13.41/6.30 NO 13.41/6.30 13.41/6.31 Ultimate: Cannot open display: 13.41/6.31 This is Ultimate 0.1.24-8dc7c08-m 13.41/6.31 [2019-03-28 22:27:14,002 INFO L170 SettingsManager]: Resetting all preferences to default values... 13.41/6.31 [2019-03-28 22:27:14,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 13.41/6.31 [2019-03-28 22:27:14,016 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 13.41/6.31 [2019-03-28 22:27:14,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 13.41/6.31 [2019-03-28 22:27:14,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 13.41/6.31 [2019-03-28 22:27:14,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 13.41/6.31 [2019-03-28 22:27:14,020 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 13.41/6.31 [2019-03-28 22:27:14,021 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 13.41/6.31 [2019-03-28 22:27:14,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 13.41/6.31 [2019-03-28 22:27:14,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 13.41/6.31 [2019-03-28 22:27:14,023 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 13.41/6.31 [2019-03-28 22:27:14,024 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 13.41/6.31 [2019-03-28 22:27:14,025 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 13.41/6.31 [2019-03-28 22:27:14,026 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 13.41/6.31 [2019-03-28 22:27:14,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 13.41/6.31 [2019-03-28 22:27:14,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 13.41/6.31 [2019-03-28 22:27:14,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 13.41/6.31 [2019-03-28 22:27:14,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 13.41/6.31 [2019-03-28 22:27:14,033 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 13.41/6.31 [2019-03-28 22:27:14,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 13.41/6.31 [2019-03-28 22:27:14,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 13.41/6.31 [2019-03-28 22:27:14,037 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 13.41/6.31 [2019-03-28 22:27:14,037 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 13.41/6.31 [2019-03-28 22:27:14,037 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 13.41/6.31 [2019-03-28 22:27:14,038 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 13.41/6.31 [2019-03-28 22:27:14,039 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 13.41/6.31 [2019-03-28 22:27:14,039 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 13.41/6.31 [2019-03-28 22:27:14,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 13.41/6.31 [2019-03-28 22:27:14,040 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 13.41/6.31 [2019-03-28 22:27:14,041 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 13.41/6.31 [2019-03-28 22:27:14,042 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 13.41/6.31 [2019-03-28 22:27:14,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 13.41/6.31 [2019-03-28 22:27:14,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 13.41/6.31 [2019-03-28 22:27:14,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 13.41/6.31 [2019-03-28 22:27:14,044 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 13.41/6.31 [2019-03-28 22:27:14,044 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 13.41/6.31 [2019-03-28 22:27:14,045 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 13.41/6.31 [2019-03-28 22:27:14,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 13.41/6.31 [2019-03-28 22:27:14,046 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 13.41/6.31 [2019-03-28 22:27:14,060 INFO L110 SettingsManager]: Loading preferences was successful 13.41/6.31 [2019-03-28 22:27:14,061 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 13.41/6.31 [2019-03-28 22:27:14,062 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 13.41/6.31 [2019-03-28 22:27:14,062 INFO L133 SettingsManager]: * Rewrite not-equals=true 13.41/6.31 [2019-03-28 22:27:14,062 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 13.41/6.31 [2019-03-28 22:27:14,062 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 13.41/6.31 [2019-03-28 22:27:14,062 INFO L133 SettingsManager]: * Use SBE=true 13.41/6.31 [2019-03-28 22:27:14,063 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 13.41/6.31 [2019-03-28 22:27:14,063 INFO L133 SettingsManager]: * Use old map elimination=false 13.41/6.31 [2019-03-28 22:27:14,063 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 13.41/6.31 [2019-03-28 22:27:14,063 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 13.41/6.31 [2019-03-28 22:27:14,063 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 13.41/6.31 [2019-03-28 22:27:14,063 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 13.41/6.31 [2019-03-28 22:27:14,064 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 13.41/6.31 [2019-03-28 22:27:14,064 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 13.41/6.31 [2019-03-28 22:27:14,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 13.41/6.31 [2019-03-28 22:27:14,064 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 13.41/6.31 [2019-03-28 22:27:14,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE 13.41/6.31 [2019-03-28 22:27:14,064 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 13.41/6.31 [2019-03-28 22:27:14,065 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 13.41/6.31 [2019-03-28 22:27:14,065 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 13.41/6.31 [2019-03-28 22:27:14,065 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 13.41/6.31 [2019-03-28 22:27:14,065 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 13.41/6.31 [2019-03-28 22:27:14,065 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 13.41/6.31 [2019-03-28 22:27:14,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 13.41/6.31 [2019-03-28 22:27:14,066 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 13.41/6.31 [2019-03-28 22:27:14,066 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 13.41/6.31 [2019-03-28 22:27:14,066 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 13.41/6.31 [2019-03-28 22:27:14,066 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 13.41/6.31 [2019-03-28 22:27:14,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 13.41/6.31 [2019-03-28 22:27:14,104 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 13.41/6.31 [2019-03-28 22:27:14,108 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 13.41/6.31 [2019-03-28 22:27:14,109 INFO L271 PluginConnector]: Initializing CDTParser... 13.41/6.31 [2019-03-28 22:27:14,110 INFO L276 PluginConnector]: CDTParser initialized 13.41/6.31 [2019-03-28 22:27:14,110 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 13.41/6.31 [2019-03-28 22:27:14,179 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/940382358d954267b56edb268d47507e/FLAGba5fa530a 13.41/6.31 [2019-03-28 22:27:14,510 INFO L307 CDTParser]: Found 1 translation units. 13.41/6.31 [2019-03-28 22:27:14,511 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 13.41/6.31 [2019-03-28 22:27:14,517 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/940382358d954267b56edb268d47507e/FLAGba5fa530a 13.41/6.31 [2019-03-28 22:27:14,922 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/940382358d954267b56edb268d47507e 13.41/6.31 [2019-03-28 22:27:14,933 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 13.41/6.31 [2019-03-28 22:27:14,935 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 13.41/6.31 [2019-03-28 22:27:14,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 13.41/6.31 [2019-03-28 22:27:14,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 13.41/6.31 [2019-03-28 22:27:14,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 13.41/6.31 [2019-03-28 22:27:14,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:27:14" (1/1) ... 13.41/6.31 [2019-03-28 22:27:14,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30683b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:14, skipping insertion in model container 13.41/6.31 [2019-03-28 22:27:14,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 10:27:14" (1/1) ... 13.41/6.31 [2019-03-28 22:27:14,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 13.41/6.31 [2019-03-28 22:27:14,969 INFO L176 MainTranslator]: Built tables and reachable declarations 13.41/6.31 [2019-03-28 22:27:15,128 INFO L206 PostProcessor]: Analyzing one entry point: main 13.41/6.31 [2019-03-28 22:27:15,133 INFO L191 MainTranslator]: Completed pre-run 13.41/6.31 [2019-03-28 22:27:15,149 INFO L206 PostProcessor]: Analyzing one entry point: main 13.41/6.31 [2019-03-28 22:27:15,226 INFO L195 MainTranslator]: Completed translation 13.41/6.31 [2019-03-28 22:27:15,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15 WrapperNode 13.41/6.31 [2019-03-28 22:27:15,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 13.41/6.31 [2019-03-28 22:27:15,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 13.41/6.31 [2019-03-28 22:27:15,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 13.41/6.31 [2019-03-28 22:27:15,228 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 13.41/6.31 [2019-03-28 22:27:15,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (1/1) ... 13.41/6.31 [2019-03-28 22:27:15,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (1/1) ... 13.41/6.31 [2019-03-28 22:27:15,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 13.41/6.31 [2019-03-28 22:27:15,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 13.41/6.31 [2019-03-28 22:27:15,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 13.41/6.31 [2019-03-28 22:27:15,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized 13.41/6.31 [2019-03-28 22:27:15,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (1/1) ... 13.41/6.31 [2019-03-28 22:27:15,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (1/1) ... 13.41/6.31 [2019-03-28 22:27:15,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (1/1) ... 13.41/6.31 [2019-03-28 22:27:15,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (1/1) ... 13.41/6.31 [2019-03-28 22:27:15,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (1/1) ... 13.41/6.31 [2019-03-28 22:27:15,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (1/1) ... 13.41/6.31 [2019-03-28 22:27:15,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (1/1) ... 13.41/6.31 [2019-03-28 22:27:15,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 13.41/6.31 [2019-03-28 22:27:15,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 13.41/6.31 [2019-03-28 22:27:15,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... 13.41/6.31 [2019-03-28 22:27:15,287 INFO L276 PluginConnector]: RCFGBuilder initialized 13.41/6.31 [2019-03-28 22:27:15,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (1/1) ... 13.41/6.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 13.41/6.31 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 13.41/6.31 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 13.41/6.31 [2019-03-28 22:27:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 13.41/6.31 [2019-03-28 22:27:15,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 13.41/6.31 [2019-03-28 22:27:15,500 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 13.41/6.31 [2019-03-28 22:27:15,501 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 13.41/6.31 [2019-03-28 22:27:15,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:27:15 BoogieIcfgContainer 13.41/6.31 [2019-03-28 22:27:15,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 13.41/6.31 [2019-03-28 22:27:15,503 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 13.41/6.31 [2019-03-28 22:27:15,503 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 13.41/6.31 [2019-03-28 22:27:15,506 INFO L276 PluginConnector]: BlockEncodingV2 initialized 13.41/6.31 [2019-03-28 22:27:15,506 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:27:15" (1/1) ... 13.41/6.31 [2019-03-28 22:27:15,522 INFO L313 BlockEncoder]: Initial Icfg 9 locations, 13 edges 13.41/6.31 [2019-03-28 22:27:15,524 INFO L258 BlockEncoder]: Using Remove infeasible edges 13.41/6.31 [2019-03-28 22:27:15,525 INFO L263 BlockEncoder]: Using Maximize final states 13.41/6.31 [2019-03-28 22:27:15,526 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 13.41/6.31 [2019-03-28 22:27:15,526 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 13.41/6.31 [2019-03-28 22:27:15,528 INFO L296 BlockEncoder]: Using Remove sink states 13.41/6.31 [2019-03-28 22:27:15,529 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 13.41/6.31 [2019-03-28 22:27:15,529 INFO L179 BlockEncoder]: Using Rewrite not-equals 13.41/6.31 [2019-03-28 22:27:15,546 INFO L185 BlockEncoder]: Using Use SBE 13.41/6.31 [2019-03-28 22:27:15,563 INFO L200 BlockEncoder]: SBE split 2 edges 13.41/6.31 [2019-03-28 22:27:15,569 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 13.41/6.31 [2019-03-28 22:27:15,571 INFO L71 MaximizeFinalStates]: 0 new accepting states 13.41/6.31 [2019-03-28 22:27:15,585 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 13.41/6.31 [2019-03-28 22:27:15,587 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 13.41/6.31 [2019-03-28 22:27:15,589 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 13.41/6.31 [2019-03-28 22:27:15,589 INFO L71 MaximizeFinalStates]: 0 new accepting states 13.41/6.31 [2019-03-28 22:27:15,589 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 13.41/6.31 [2019-03-28 22:27:15,590 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 13.41/6.31 [2019-03-28 22:27:15,590 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 10 edges 13.41/6.31 [2019-03-28 22:27:15,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:27:15 BasicIcfg 13.41/6.31 [2019-03-28 22:27:15,591 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 13.41/6.31 [2019-03-28 22:27:15,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 13.41/6.31 [2019-03-28 22:27:15,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... 13.41/6.31 [2019-03-28 22:27:15,595 INFO L276 PluginConnector]: TraceAbstraction initialized 13.41/6.31 [2019-03-28 22:27:15,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 10:27:14" (1/4) ... 13.41/6.31 [2019-03-28 22:27:15,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fdaf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:27:15, skipping insertion in model container 13.41/6.31 [2019-03-28 22:27:15,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (2/4) ... 13.41/6.31 [2019-03-28 22:27:15,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fdaf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 10:27:15, skipping insertion in model container 13.41/6.31 [2019-03-28 22:27:15,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:27:15" (3/4) ... 13.41/6.31 [2019-03-28 22:27:15,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fdaf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:27:15, skipping insertion in model container 13.41/6.31 [2019-03-28 22:27:15,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:27:15" (4/4) ... 13.41/6.31 [2019-03-28 22:27:15,599 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 13.41/6.31 [2019-03-28 22:27:15,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 13.41/6.31 [2019-03-28 22:27:15,617 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 13.41/6.31 [2019-03-28 22:27:15,635 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 13.41/6.31 [2019-03-28 22:27:15,663 INFO L133 ementStrategyFactory]: Using default assertion order modulation 13.41/6.31 [2019-03-28 22:27:15,664 INFO L382 AbstractCegarLoop]: Interprodecural is true 13.41/6.31 [2019-03-28 22:27:15,664 INFO L383 AbstractCegarLoop]: Hoare is true 13.41/6.31 [2019-03-28 22:27:15,664 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 13.41/6.31 [2019-03-28 22:27:15,665 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 13.41/6.31 [2019-03-28 22:27:15,665 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 13.41/6.31 [2019-03-28 22:27:15,665 INFO L387 AbstractCegarLoop]: Difference is false 13.41/6.31 [2019-03-28 22:27:15,665 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 13.41/6.31 [2019-03-28 22:27:15,665 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 13.41/6.31 [2019-03-28 22:27:15,679 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. 13.41/6.31 [2019-03-28 22:27:15,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 13.41/6.31 [2019-03-28 22:27:15,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. 13.41/6.31 [2019-03-28 22:27:15,738 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 18) no Hoare annotation was computed. 13.41/6.31 [2019-03-28 22:27:15,738 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 13.41/6.31 [2019-03-28 22:27:15,738 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 19) no Hoare annotation was computed. 13.41/6.31 [2019-03-28 22:27:15,738 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 22) no Hoare annotation was computed. 13.41/6.31 [2019-03-28 22:27:15,739 INFO L451 ceAbstractionStarter]: At program point L10-1(lines 9 23) the Hoare annotation is: true 13.41/6.31 [2019-03-28 22:27:15,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:27:15 BasicIcfg 13.41/6.31 [2019-03-28 22:27:15,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 13.41/6.31 [2019-03-28 22:27:15,748 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 13.41/6.31 [2019-03-28 22:27:15,748 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 13.41/6.31 [2019-03-28 22:27:15,751 INFO L276 PluginConnector]: BuchiAutomizer initialized 13.41/6.31 [2019-03-28 22:27:15,752 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 13.41/6.31 [2019-03-28 22:27:15,752 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 10:27:14" (1/5) ... 13.41/6.31 [2019-03-28 22:27:15,753 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55f8000f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:27:15, skipping insertion in model container 13.41/6.31 [2019-03-28 22:27:15,753 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 13.41/6.31 [2019-03-28 22:27:15,753 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 10:27:15" (2/5) ... 13.41/6.31 [2019-03-28 22:27:15,754 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55f8000f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 10:27:15, skipping insertion in model container 13.41/6.31 [2019-03-28 22:27:15,754 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 13.41/6.31 [2019-03-28 22:27:15,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 10:27:15" (3/5) ... 13.41/6.31 [2019-03-28 22:27:15,754 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55f8000f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:27:15, skipping insertion in model container 13.41/6.31 [2019-03-28 22:27:15,755 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 13.41/6.31 [2019-03-28 22:27:15,755 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 10:27:15" (4/5) ... 13.41/6.31 [2019-03-28 22:27:15,755 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55f8000f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:27:15, skipping insertion in model container 13.41/6.31 [2019-03-28 22:27:15,755 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 13.41/6.31 [2019-03-28 22:27:15,755 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 10:27:15" (5/5) ... 13.41/6.31 [2019-03-28 22:27:15,757 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 13.41/6.31 [2019-03-28 22:27:15,785 INFO L133 ementStrategyFactory]: Using default assertion order modulation 13.41/6.31 [2019-03-28 22:27:15,785 INFO L374 BuchiCegarLoop]: Interprodecural is true 13.41/6.31 [2019-03-28 22:27:15,785 INFO L375 BuchiCegarLoop]: Hoare is true 13.41/6.31 [2019-03-28 22:27:15,786 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 13.41/6.31 [2019-03-28 22:27:15,786 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 13.41/6.31 [2019-03-28 22:27:15,786 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 13.41/6.31 [2019-03-28 22:27:15,786 INFO L379 BuchiCegarLoop]: Difference is false 13.41/6.31 [2019-03-28 22:27:15,786 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 13.41/6.31 [2019-03-28 22:27:15,786 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 13.41/6.31 [2019-03-28 22:27:15,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 13.41/6.31 [2019-03-28 22:27:15,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 13.41/6.31 [2019-03-28 22:27:15,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 13.41/6.31 [2019-03-28 22:27:15,808 INFO L119 BuchiIsEmpty]: Starting construction of run 13.41/6.31 [2019-03-28 22:27:15,815 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 13.41/6.31 [2019-03-28 22:27:15,815 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 13.41/6.31 [2019-03-28 22:27:15,815 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 13.41/6.31 [2019-03-28 22:27:15,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 13.41/6.31 [2019-03-28 22:27:15,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 13.41/6.31 [2019-03-28 22:27:15,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 13.41/6.31 [2019-03-28 22:27:15,816 INFO L119 BuchiIsEmpty]: Starting construction of run 13.41/6.31 [2019-03-28 22:27:15,817 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 13.41/6.31 [2019-03-28 22:27:15,817 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 13.41/6.31 [2019-03-28 22:27:15,822 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [37] ULTIMATE.startENTRY-->L10-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 7#L10-1true 13.41/6.31 [2019-03-28 22:27:15,822 INFO L796 eck$LassoCheckResult]: Loop: 7#L10-1true [52] L10-1-->L10: Formula: (> 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 3#L10true [54] L10-->L10-1: Formula: (and (> v_ULTIMATE.start_main_~i~0_17 35) (= v_ULTIMATE.start_main_~i~0_16 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 7#L10-1true 13.41/6.31 [2019-03-28 22:27:15,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 13.41/6.31 [2019-03-28 22:27:15,829 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times 13.41/6.31 [2019-03-28 22:27:15,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 13.41/6.31 [2019-03-28 22:27:15,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 13.41/6.31 [2019-03-28 22:27:15,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:15,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:15,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:15,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 13.41/6.31 [2019-03-28 22:27:15,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2627, now seen corresponding path program 1 times 13.41/6.31 [2019-03-28 22:27:15,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 13.41/6.31 [2019-03-28 22:27:15,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 13.41/6.31 [2019-03-28 22:27:15,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:15,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:15,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 13.41/6.31 [2019-03-28 22:27:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 13.41/6.31 [2019-03-28 22:27:15,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 13.41/6.31 [2019-03-28 22:27:15,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 13.41/6.31 [2019-03-28 22:27:15,956 INFO L811 eck$LassoCheckResult]: loop already infeasible 13.41/6.31 [2019-03-28 22:27:15,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 13.41/6.31 [2019-03-28 22:27:15,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 13.41/6.31 [2019-03-28 22:27:15,973 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. 13.41/6.31 [2019-03-28 22:27:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 13.41/6.31 [2019-03-28 22:27:16,023 INFO L93 Difference]: Finished difference Result 8 states and 14 transitions. 13.41/6.31 [2019-03-28 22:27:16,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 13.41/6.31 [2019-03-28 22:27:16,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 14 transitions. 13.41/6.31 [2019-03-28 22:27:16,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 13.41/6.31 [2019-03-28 22:27:16,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 14 transitions. 13.41/6.31 [2019-03-28 22:27:16,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 13.41/6.31 [2019-03-28 22:27:16,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 13.41/6.31 [2019-03-28 22:27:16,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 14 transitions. 13.41/6.31 [2019-03-28 22:27:16,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 13.41/6.31 [2019-03-28 22:27:16,034 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 14 transitions. 13.41/6.31 [2019-03-28 22:27:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 14 transitions. 13.41/6.31 [2019-03-28 22:27:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. 13.41/6.31 [2019-03-28 22:27:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 13.41/6.31 [2019-03-28 22:27:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. 13.41/6.31 [2019-03-28 22:27:16,064 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 14 transitions. 13.41/6.31 [2019-03-28 22:27:16,065 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 14 transitions. 13.41/6.31 [2019-03-28 22:27:16,065 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 13.41/6.31 [2019-03-28 22:27:16,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 14 transitions. 13.41/6.31 [2019-03-28 22:27:16,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 13.41/6.31 [2019-03-28 22:27:16,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 13.41/6.31 [2019-03-28 22:27:16,066 INFO L119 BuchiIsEmpty]: Starting construction of run 13.41/6.31 [2019-03-28 22:27:16,066 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 13.41/6.31 [2019-03-28 22:27:16,066 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 13.41/6.31 [2019-03-28 22:27:16,067 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L10-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 24#L10-1 13.41/6.31 [2019-03-28 22:27:16,067 INFO L796 eck$LassoCheckResult]: Loop: 24#L10-1 [52] L10-1-->L10: Formula: (> 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 22#L10 [55] L10-->L10-1: Formula: (and (> 0 (+ v_ULTIMATE.start_main_~i~0_17 5)) (= v_ULTIMATE.start_main_~i~0_16 0)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 24#L10-1 13.41/6.31 [2019-03-28 22:27:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 13.41/6.31 [2019-03-28 22:27:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times 13.41/6.31 [2019-03-28 22:27:16,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 13.41/6.31 [2019-03-28 22:27:16,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 13.41/6.31 [2019-03-28 22:27:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 13.41/6.31 [2019-03-28 22:27:16,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2628, now seen corresponding path program 1 times 13.41/6.31 [2019-03-28 22:27:16,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 13.41/6.31 [2019-03-28 22:27:16,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 13.41/6.31 [2019-03-28 22:27:16,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 13.41/6.31 [2019-03-28 22:27:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash 67015, now seen corresponding path program 1 times 13.41/6.31 [2019-03-28 22:27:16,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 13.41/6.31 [2019-03-28 22:27:16,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 13.41/6.31 [2019-03-28 22:27:16,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,123 INFO L216 LassoAnalysis]: Preferences: 13.41/6.31 [2019-03-28 22:27:16,124 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 13.41/6.31 [2019-03-28 22:27:16,124 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 13.41/6.31 [2019-03-28 22:27:16,124 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 13.41/6.31 [2019-03-28 22:27:16,124 INFO L127 ssoRankerPreferences]: Use exernal solver: true 13.41/6.31 [2019-03-28 22:27:16,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 13.41/6.31 [2019-03-28 22:27:16,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 13.41/6.31 [2019-03-28 22:27:16,125 INFO L130 ssoRankerPreferences]: Path of dumped script: 13.41/6.31 [2019-03-28 22:27:16,125 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 13.41/6.31 [2019-03-28 22:27:16,125 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 13.41/6.31 [2019-03-28 22:27:16,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 13.41/6.31 [2019-03-28 22:27:16,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 13.41/6.31 [2019-03-28 22:27:16,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 13.41/6.31 [2019-03-28 22:27:16,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 13.41/6.31 [2019-03-28 22:27:16,225 INFO L300 LassoAnalysis]: Preprocessing complete. 13.41/6.31 [2019-03-28 22:27:16,226 INFO L412 LassoAnalysis]: Checking for nontermination... 13.41/6.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 13.41/6.31 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 13.41/6.31 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 13.41/6.31 [2019-03-28 22:27:16,235 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 13.41/6.31 [2019-03-28 22:27:16,236 INFO L163 nArgumentSynthesizer]: Using integer mode. 13.41/6.31 [2019-03-28 22:27:16,269 INFO L445 LassoAnalysis]: Proved nontermination for one component. 13.41/6.31 [2019-03-28 22:27:16,269 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 13.41/6.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 13.41/6.31 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 13.41/6.31 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 13.41/6.31 [2019-03-28 22:27:16,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 13.41/6.31 [2019-03-28 22:27:16,276 INFO L163 nArgumentSynthesizer]: Using integer mode. 13.41/6.31 [2019-03-28 22:27:16,303 INFO L445 LassoAnalysis]: Proved nontermination for one component. 13.41/6.31 [2019-03-28 22:27:16,304 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 13.41/6.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 13.41/6.31 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 13.41/6.31 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 13.41/6.31 [2019-03-28 22:27:16,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 13.41/6.31 [2019-03-28 22:27:16,310 INFO L163 nArgumentSynthesizer]: Using integer mode. 13.41/6.31 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 13.41/6.31 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 13.41/6.31 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 13.41/6.31 [2019-03-28 22:27:16,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 13.41/6.31 [2019-03-28 22:27:16,342 INFO L163 nArgumentSynthesizer]: Using integer mode. 13.41/6.31 [2019-03-28 22:27:16,377 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 13.41/6.31 [2019-03-28 22:27:16,379 INFO L216 LassoAnalysis]: Preferences: 13.41/6.31 [2019-03-28 22:27:16,380 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 13.41/6.31 [2019-03-28 22:27:16,380 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 13.41/6.31 [2019-03-28 22:27:16,380 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 13.41/6.31 [2019-03-28 22:27:16,380 INFO L127 ssoRankerPreferences]: Use exernal solver: false 13.41/6.31 [2019-03-28 22:27:16,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 13.41/6.31 [2019-03-28 22:27:16,381 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 13.41/6.31 [2019-03-28 22:27:16,381 INFO L130 ssoRankerPreferences]: Path of dumped script: 13.41/6.31 [2019-03-28 22:27:16,381 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 13.41/6.31 [2019-03-28 22:27:16,381 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 13.41/6.31 [2019-03-28 22:27:16,381 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 13.41/6.31 [2019-03-28 22:27:16,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 13.41/6.31 [2019-03-28 22:27:16,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 13.41/6.31 [2019-03-28 22:27:16,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 13.41/6.31 [2019-03-28 22:27:16,455 INFO L300 LassoAnalysis]: Preprocessing complete. 13.41/6.31 [2019-03-28 22:27:16,461 INFO L497 LassoAnalysis]: Using template 'affine'. 13.41/6.31 [2019-03-28 22:27:16,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 13.41/6.31 Termination analysis: LINEAR_WITH_GUESSES 13.41/6.31 Number of strict supporting invariants: 0 13.41/6.31 Number of non-strict supporting invariants: 1 13.41/6.31 Consider only non-deceasing supporting invariants: true 13.41/6.31 Simplify termination arguments: true 13.41/6.31 Simplify supporting invariants: trueOverapproximate stem: false 13.41/6.31 [2019-03-28 22:27:16,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. 13.41/6.31 [2019-03-28 22:27:16,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 13.41/6.31 [2019-03-28 22:27:16,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 13.41/6.31 [2019-03-28 22:27:16,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 13.41/6.31 [2019-03-28 22:27:16,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 13.41/6.31 [2019-03-28 22:27:16,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 13.41/6.31 [2019-03-28 22:27:16,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 13.41/6.31 [2019-03-28 22:27:16,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 13.41/6.31 Termination analysis: LINEAR_WITH_GUESSES 13.41/6.31 Number of strict supporting invariants: 0 13.41/6.31 Number of non-strict supporting invariants: 1 13.41/6.31 Consider only non-deceasing supporting invariants: true 13.41/6.31 Simplify termination arguments: true 13.41/6.31 Simplify supporting invariants: trueOverapproximate stem: false 13.41/6.31 [2019-03-28 22:27:16,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. 13.41/6.31 [2019-03-28 22:27:16,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 13.41/6.31 [2019-03-28 22:27:16,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 13.41/6.31 [2019-03-28 22:27:16,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 13.41/6.31 [2019-03-28 22:27:16,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 13.41/6.31 [2019-03-28 22:27:16,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 13.41/6.31 [2019-03-28 22:27:16,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 13.41/6.31 [2019-03-28 22:27:16,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 13.41/6.31 Termination analysis: LINEAR_WITH_GUESSES 13.41/6.31 Number of strict supporting invariants: 0 13.41/6.31 Number of non-strict supporting invariants: 1 13.41/6.31 Consider only non-deceasing supporting invariants: true 13.41/6.31 Simplify termination arguments: true 13.41/6.31 Simplify supporting invariants: trueOverapproximate stem: false 13.41/6.31 [2019-03-28 22:27:16,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. 13.41/6.31 [2019-03-28 22:27:16,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 13.41/6.31 [2019-03-28 22:27:16,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 13.41/6.31 [2019-03-28 22:27:16,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 13.41/6.31 [2019-03-28 22:27:16,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 13.41/6.31 [2019-03-28 22:27:16,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 13.41/6.31 [2019-03-28 22:27:16,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 13.41/6.31 [2019-03-28 22:27:16,503 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 13.41/6.31 [2019-03-28 22:27:16,507 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 13.41/6.31 [2019-03-28 22:27:16,508 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 13.41/6.31 [2019-03-28 22:27:16,510 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 13.41/6.31 [2019-03-28 22:27:16,510 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 13.41/6.31 [2019-03-28 22:27:16,510 INFO L518 LassoAnalysis]: Proved termination. 13.41/6.31 [2019-03-28 22:27:16,511 INFO L520 LassoAnalysis]: Termination argument consisting of: 13.41/6.31 Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 13.41/6.31 Supporting invariants [] 13.41/6.31 [2019-03-28 22:27:16,513 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 13.41/6.31 [2019-03-28 22:27:16,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 13.41/6.31 [2019-03-28 22:27:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 13.41/6.31 [2019-03-28 22:27:16,564 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core 13.41/6.31 [2019-03-28 22:27:16,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... 13.41/6.31 [2019-03-28 22:27:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 13.41/6.31 [2019-03-28 22:27:16,574 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core 13.41/6.31 [2019-03-28 22:27:16,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... 13.41/6.31 [2019-03-28 22:27:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 13.41/6.31 [2019-03-28 22:27:16,598 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 13.41/6.31 [2019-03-28 22:27:16,601 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 13.41/6.31 [2019-03-28 22:27:16,602 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 14 transitions. cyclomatic complexity: 7 Second operand 3 states. 13.41/6.31 [2019-03-28 22:27:16,693 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 14 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 26 states and 44 transitions. Complement of second has 8 states. 13.41/6.31 [2019-03-28 22:27:16,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 13.41/6.31 [2019-03-28 22:27:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 13.41/6.31 [2019-03-28 22:27:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. 13.41/6.31 [2019-03-28 22:27:16,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 1 letters. Loop has 2 letters. 13.41/6.31 [2019-03-28 22:27:16,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. 13.41/6.31 [2019-03-28 22:27:16,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 3 letters. Loop has 2 letters. 13.41/6.31 [2019-03-28 22:27:16,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. 13.41/6.31 [2019-03-28 22:27:16,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 1 letters. Loop has 4 letters. 13.41/6.31 [2019-03-28 22:27:16,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. 13.41/6.31 [2019-03-28 22:27:16,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 44 transitions. 13.41/6.31 [2019-03-28 22:27:16,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 13.41/6.31 [2019-03-28 22:27:16,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 43 transitions. 13.41/6.31 [2019-03-28 22:27:16,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 13.41/6.31 [2019-03-28 22:27:16,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 13.41/6.31 [2019-03-28 22:27:16,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 43 transitions. 13.41/6.31 [2019-03-28 22:27:16,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 13.41/6.31 [2019-03-28 22:27:16,708 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 43 transitions. 13.41/6.31 [2019-03-28 22:27:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 43 transitions. 13.41/6.31 [2019-03-28 22:27:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. 13.41/6.31 [2019-03-28 22:27:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 13.41/6.31 [2019-03-28 22:27:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. 13.41/6.31 [2019-03-28 22:27:16,712 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 33 transitions. 13.41/6.31 [2019-03-28 22:27:16,712 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 33 transitions. 13.41/6.31 [2019-03-28 22:27:16,712 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 13.41/6.31 [2019-03-28 22:27:16,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 33 transitions. 13.41/6.31 [2019-03-28 22:27:16,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 13.41/6.31 [2019-03-28 22:27:16,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 13.41/6.31 [2019-03-28 22:27:16,713 INFO L119 BuchiIsEmpty]: Starting construction of run 13.41/6.31 [2019-03-28 22:27:16,713 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 13.41/6.31 [2019-03-28 22:27:16,714 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 13.41/6.31 [2019-03-28 22:27:16,714 INFO L794 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY [37] ULTIMATE.startENTRY-->L10-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 98#L10-1 [52] L10-1-->L10: Formula: (> 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 92#L10 13.41/6.31 [2019-03-28 22:27:16,714 INFO L796 eck$LassoCheckResult]: Loop: 92#L10 [35] L10-->L11: Formula: (and (<= v_ULTIMATE.start_main_~i~0_8 35) (<= 0 (+ v_ULTIMATE.start_main_~i~0_8 5))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[] 93#L11 [38] L11-->L10-1: Formula: (and (< v_ULTIMATE.start_main_~i~0_10 0) (= v_ULTIMATE.start_main_~i~0_9 (- 5))) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 104#L10-1 [52] L10-1-->L10: Formula: (> 0 v_ULTIMATE.start_main_~i~0_7) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} AuxVars[] AssignedVars[] 92#L10 13.41/6.31 [2019-03-28 22:27:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 13.41/6.31 [2019-03-28 22:27:16,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2160, now seen corresponding path program 1 times 13.41/6.31 [2019-03-28 22:27:16,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 13.41/6.31 [2019-03-28 22:27:16,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 13.41/6.31 [2019-03-28 22:27:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 13.41/6.31 [2019-03-28 22:27:16,721 INFO L82 PathProgramCache]: Analyzing trace with hash 64656, now seen corresponding path program 1 times 13.41/6.31 [2019-03-28 22:27:16,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 13.41/6.31 [2019-03-28 22:27:16,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 13.41/6.31 [2019-03-28 22:27:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 13.41/6.31 [2019-03-28 22:27:16,729 INFO L82 PathProgramCache]: Analyzing trace with hash 64383425, now seen corresponding path program 1 times 13.41/6.31 [2019-03-28 22:27:16,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 13.41/6.31 [2019-03-28 22:27:16,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 13.41/6.31 [2019-03-28 22:27:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 13.41/6.31 [2019-03-28 22:27:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 13.41/6.31 [2019-03-28 22:27:16,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 10:27:16 BasicIcfg 13.41/6.31 [2019-03-28 22:27:16,785 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 13.41/6.31 [2019-03-28 22:27:16,785 INFO L168 Benchmark]: Toolchain (without parser) took 1851.42 ms. Allocated memory was 649.6 MB in the beginning and 676.3 MB in the end (delta: 26.7 MB). Free memory was 559.2 MB in the beginning and 513.6 MB in the end (delta: 45.6 MB). Peak memory consumption was 72.3 MB. Max. memory is 50.3 GB. 13.41/6.31 [2019-03-28 22:27:16,787 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 579.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 13.41/6.31 [2019-03-28 22:27:16,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.55 ms. Allocated memory was 649.6 MB in the beginning and 676.3 MB in the end (delta: 26.7 MB). Free memory was 559.2 MB in the beginning and 644.1 MB in the end (delta: -84.9 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 13.41/6.31 [2019-03-28 22:27:16,788 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.34 ms. Allocated memory is still 676.3 MB. Free memory was 644.1 MB in the beginning and 641.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 13.41/6.31 [2019-03-28 22:27:16,789 INFO L168 Benchmark]: Boogie Preprocessor took 20.62 ms. Allocated memory is still 676.3 MB. Free memory was 641.2 MB in the beginning and 640.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 13.41/6.31 [2019-03-28 22:27:16,790 INFO L168 Benchmark]: RCFGBuilder took 216.10 ms. Allocated memory is still 676.3 MB. Free memory was 640.2 MB in the beginning and 626.4 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 50.3 GB. 13.41/6.31 [2019-03-28 22:27:16,790 INFO L168 Benchmark]: BlockEncodingV2 took 88.01 ms. Allocated memory is still 676.3 MB. Free memory was 626.4 MB in the beginning and 621.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 13.41/6.31 [2019-03-28 22:27:16,791 INFO L168 Benchmark]: TraceAbstraction took 155.74 ms. Allocated memory is still 676.3 MB. Free memory was 621.0 MB in the beginning and 612.4 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 13.41/6.31 [2019-03-28 22:27:16,791 INFO L168 Benchmark]: BuchiAutomizer took 1036.74 ms. Allocated memory is still 676.3 MB. Free memory was 611.3 MB in the beginning and 513.6 MB in the end (delta: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 50.3 GB. 13.41/6.31 [2019-03-28 22:27:16,795 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 13.41/6.31 --- Results --- 13.41/6.31 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 13.41/6.31 - StatisticsResult: Initial Icfg 13.41/6.31 9 locations, 13 edges 13.41/6.31 - StatisticsResult: Encoded RCFG 13.41/6.31 5 locations, 10 edges 13.41/6.31 * Results from de.uni_freiburg.informatik.ultimate.core: 13.41/6.31 - StatisticsResult: Toolchain Benchmarks 13.41/6.31 Benchmark results are: 13.41/6.31 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 579.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 13.41/6.31 * CACSL2BoogieTranslator took 291.55 ms. Allocated memory was 649.6 MB in the beginning and 676.3 MB in the end (delta: 26.7 MB). Free memory was 559.2 MB in the beginning and 644.1 MB in the end (delta: -84.9 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 13.41/6.31 * Boogie Procedure Inliner took 37.34 ms. Allocated memory is still 676.3 MB. Free memory was 644.1 MB in the beginning and 641.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 50.3 GB. 13.41/6.31 * Boogie Preprocessor took 20.62 ms. Allocated memory is still 676.3 MB. Free memory was 641.2 MB in the beginning and 640.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 13.41/6.31 * RCFGBuilder took 216.10 ms. Allocated memory is still 676.3 MB. Free memory was 640.2 MB in the beginning and 626.4 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 50.3 GB. 13.41/6.31 * BlockEncodingV2 took 88.01 ms. Allocated memory is still 676.3 MB. Free memory was 626.4 MB in the beginning and 621.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 13.41/6.31 * TraceAbstraction took 155.74 ms. Allocated memory is still 676.3 MB. Free memory was 621.0 MB in the beginning and 612.4 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 13.41/6.31 * BuchiAutomizer took 1036.74 ms. Allocated memory is still 676.3 MB. Free memory was 611.3 MB in the beginning and 513.6 MB in the end (delta: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 50.3 GB. 13.41/6.31 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 13.41/6.31 - AllSpecificationsHoldResult: All specifications hold 13.41/6.31 We were not able to verify any specifiation because the program does not contain any specification. 13.41/6.31 - InvariantResult [Line: 9]: Loop Invariant 13.41/6.31 Derived loop invariant: 1 13.41/6.31 - StatisticsResult: Ultimate Automizer benchmark data 13.41/6.31 CFG has 1 procedures, 5 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 13.41/6.31 - StatisticsResult: Constructed decomposition of program 13.41/6.31 Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function -1 * i and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 18 locations. 13.41/6.31 - StatisticsResult: Timing statistics 13.41/6.31 BüchiAutomizer plugin needed 0.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 6 SDtfs, 20 SDslu, 0 SDs, 0 SdLazy, 54 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax220 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq139 hnf92 smp100 dnf100 smp100 tf115 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s 13.41/6.31 - TerminationAnalysisResult: Nontermination possible 13.41/6.31 Buchi Automizer proved that your program is nonterminating for some inputs 13.41/6.31 - FixpointNonTerminationResult [Line: 10]: Nontermination argument in form of an infinite program execution. 13.41/6.31 Nontermination argument in form of an infinite execution 13.41/6.31 State at position 0 is 13.41/6.31 {} 13.41/6.31 State at position 1 is 13.41/6.31 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c4800e=0, \result=0, i=-5} 13.41/6.31 - StatisticsResult: NonterminationArgumentStatistics 13.41/6.31 Fixpoint 13.41/6.31 - NonterminatingLassoResult [Line: 10]: Nonterminating execution 13.41/6.31 Found a nonterminating execution for the following lasso shaped sequence of statements. 13.41/6.31 Stem: 13.41/6.31 [L6] int i; 13.41/6.31 [L7] i = __VERIFIER_nondet_int() 13.41/6.31 [L9] COND TRUE i != 0 13.41/6.31 Loop: 13.41/6.31 [L10] COND TRUE -5 <= i && i <= 35 13.41/6.31 [L11] COND TRUE i < 0 13.41/6.31 [L12] i = -5 13.41/6.31 [L9] COND TRUE i != 0 13.41/6.31 End of lasso representation. 13.41/6.31 RESULT: Ultimate proved your program to be incorrect! 13.41/6.31 !SESSION 2019-03-28 22:27:11.671 ----------------------------------------------- 13.41/6.31 eclipse.buildId=unknown 13.41/6.31 java.version=1.8.0_181 13.41/6.31 java.vendor=Oracle Corporation 13.41/6.31 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 13.41/6.31 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 13.41/6.31 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 13.41/6.31 13.41/6.31 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 22:27:17.029 13.41/6.31 !MESSAGE The workspace will exit with unsaved changes in this session. 13.41/6.31 Received shutdown request... 13.41/6.31 Ultimate: 13.41/6.31 GTK+ Version Check 13.41/6.31 EOF