./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:24:00,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:24:00,272 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:24:00,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:24:00,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:24:00,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:24:00,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:24:00,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:24:00,281 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:24:00,281 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:24:00,282 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:24:00,282 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:24:00,283 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:24:00,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:24:00,284 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:24:00,284 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:24:00,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:24:00,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:24:00,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:24:00,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:24:00,289 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:24:00,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:24:00,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:24:00,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:24:00,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:24:00,292 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:24:00,293 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:24:00,293 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:24:00,294 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:24:00,294 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:24:00,294 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:24:00,295 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:24:00,295 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:24:00,295 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:24:00,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:24:00,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:24:00,296 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:24:00,305 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:24:00,305 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:24:00,306 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:24:00,306 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:24:00,306 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:24:00,307 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:24:00,307 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:24:00,307 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:24:00,307 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:24:00,307 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:24:00,307 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:24:00,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:24:00,308 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:24:00,308 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:24:00,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:24:00,308 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:24:00,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:24:00,308 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:24:00,308 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:24:00,309 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:24:00,309 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:24:00,309 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:24:00,309 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:24:00,309 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:24:00,309 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:24:00,310 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:24:00,310 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:24:00,310 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:24:00,310 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:24:00,311 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 [2018-11-23 15:24:00,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:24:00,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:24:00,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:24:00,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:24:00,352 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:24:00,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i [2018-11-23 15:24:00,396 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/data/c6a2548ca/08903fc194e24556a85d3b7ac5e7e812/FLAGe07a198e2 [2018-11-23 15:24:00,822 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:24:00,822 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i [2018-11-23 15:24:00,829 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/data/c6a2548ca/08903fc194e24556a85d3b7ac5e7e812/FLAGe07a198e2 [2018-11-23 15:24:00,837 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/data/c6a2548ca/08903fc194e24556a85d3b7ac5e7e812 [2018-11-23 15:24:00,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:24:00,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:24:00,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:24:00,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:24:00,843 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:24:00,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:24:00" (1/1) ... [2018-11-23 15:24:00,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7ad327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:00, skipping insertion in model container [2018-11-23 15:24:00,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:24:00" (1/1) ... [2018-11-23 15:24:00,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:24:00,877 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:24:01,056 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:24:01,063 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:24:01,131 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:24:01,155 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:24:01,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01 WrapperNode [2018-11-23 15:24:01,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:24:01,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:24:01,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:24:01,156 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:24:01,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01" (1/1) ... [2018-11-23 15:24:01,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01" (1/1) ... [2018-11-23 15:24:01,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:24:01,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:24:01,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:24:01,191 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:24:01,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01" (1/1) ... [2018-11-23 15:24:01,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01" (1/1) ... [2018-11-23 15:24:01,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01" (1/1) ... [2018-11-23 15:24:01,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01" (1/1) ... [2018-11-23 15:24:01,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01" (1/1) ... [2018-11-23 15:24:01,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01" (1/1) ... [2018-11-23 15:24:01,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01" (1/1) ... [2018-11-23 15:24:01,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:24:01,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:24:01,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:24:01,209 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:24:01,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:24:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:24:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:24:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:24:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:24:01,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:24:01,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:24:01,414 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:24:01,414 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 15:24:01,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:24:01 BoogieIcfgContainer [2018-11-23 15:24:01,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:24:01,414 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:24:01,415 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:24:01,418 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:24:01,418 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:24:01,418 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:24:00" (1/3) ... [2018-11-23 15:24:01,419 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@272929e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:24:01, skipping insertion in model container [2018-11-23 15:24:01,420 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:24:01,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:24:01" (2/3) ... [2018-11-23 15:24:01,420 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@272929e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:24:01, skipping insertion in model container [2018-11-23 15:24:01,420 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:24:01,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:24:01" (3/3) ... [2018-11-23 15:24:01,422 INFO L375 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca_false-termination.c.i [2018-11-23 15:24:01,466 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:24:01,467 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:24:01,467 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:24:01,467 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:24:01,467 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:24:01,467 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:24:01,467 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:24:01,467 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:24:01,467 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:24:01,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 15:24:01,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:24:01,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:24:01,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:24:01,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:24:01,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 15:24:01,503 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:24:01,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 15:24:01,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:24:01,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:24:01,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:24:01,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:24:01,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 15:24:01,511 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 14#L552-3true [2018-11-23 15:24:01,512 INFO L796 eck$LassoCheckResult]: Loop: 14#L552-3true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L551-1true assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 8#L552true assume !main_#t~short7; 12#L552-2true assume !main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 14#L552-3true [2018-11-23 15:24:01,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:01,517 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 15:24:01,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:01,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:01,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:01,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:01,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:01,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:01,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1144151, now seen corresponding path program 1 times [2018-11-23 15:24:01,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:01,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:01,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:01,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 889571353, now seen corresponding path program 1 times [2018-11-23 15:24:01,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:01,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:01,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:01,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:01,842 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:24:01,843 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:24:01,843 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:24:01,843 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:24:01,843 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:24:01,843 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:24:01,843 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:24:01,843 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:24:01,844 INFO L131 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-23 15:24:01,844 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:24:01,844 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:24:01,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:01,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:24:02,146 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:24:02,151 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:24:02,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:02,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:02,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:02,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:02,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:02,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:02,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:02,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:02,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:02,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:02,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:02,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:02,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:02,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:02,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:02,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:02,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:02,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:02,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:02,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:02,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:02,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:02,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:02,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:02,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:24:02,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:24:02,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:24:02,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:02,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:02,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:02,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:02,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:02,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:02,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:24:02,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:24:02,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:24:02,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:24:02,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:24:02,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:24:02,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:24:02,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:24:02,246 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:24:02,255 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:24:02,255 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 15:24:02,257 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:24:02,258 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:24:02,258 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:24:02,259 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-23 15:24:02,274 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 15:24:02,279 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 15:24:02,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:24:02,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:24:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:24:02,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:24:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:24:02,354 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 15:24:02,355 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-11-23 15:24:02,429 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 42 states and 56 transitions. Complement of second has 10 states. [2018-11-23 15:24:02,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 15:24:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 15:24:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-23 15:24:02,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 15:24:02,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:24:02,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 15:24:02,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:24:02,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-23 15:24:02,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:24:02,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2018-11-23 15:24:02,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:24:02,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 23 states and 35 transitions. [2018-11-23 15:24:02,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 15:24:02,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 15:24:02,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2018-11-23 15:24:02,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:24:02,443 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-23 15:24:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2018-11-23 15:24:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-23 15:24:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 15:24:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-23 15:24:02,468 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 15:24:02,469 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 15:24:02,469 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:24:02,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-23 15:24:02,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:24:02,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:24:02,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:24:02,470 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:24:02,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 15:24:02,470 INFO L794 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 116#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 117#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 129#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 130#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 125#L552-2 [2018-11-23 15:24:02,470 INFO L796 eck$LassoCheckResult]: Loop: 125#L552-2 assume !main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 128#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 133#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 124#L552 assume !main_#t~short7; 125#L552-2 [2018-11-23 15:24:02,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:02,471 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-11-23 15:24:02,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:02,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:02,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:02,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:02,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1943531, now seen corresponding path program 2 times [2018-11-23 15:24:02,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:02,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:02,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:02,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:24:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:24:02,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:24:02,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:24:02,543 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:24:02,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:24:02,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:24:02,545 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-23 15:24:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:24:02,576 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2018-11-23 15:24:02,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:24:02,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-11-23 15:24:02,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:24:02,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 27 transitions. [2018-11-23 15:24:02,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 15:24:02,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 15:24:02,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-23 15:24:02,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:24:02,579 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-23 15:24:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-23 15:24:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 15:24:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 15:24:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-11-23 15:24:02,580 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-23 15:24:02,581 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-23 15:24:02,581 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:24:02,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-11-23 15:24:02,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 15:24:02,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:24:02,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:24:02,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:24:02,582 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 15:24:02,582 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 171#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 184#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 178#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 180#L552-2 [2018-11-23 15:24:02,582 INFO L796 eck$LassoCheckResult]: Loop: 180#L552-2 assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 187#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 183#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 186#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 189#L552 assume !main_#t~short7; 180#L552-2 [2018-11-23 15:24:02,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 2 times [2018-11-23 15:24:02,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:02,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:02,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:24:02,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:02,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash 48745192, now seen corresponding path program 1 times [2018-11-23 15:24:02,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:02,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:02,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:24:02,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:24:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:24:02,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:24:02,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:24:02,627 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:24:02,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:24:02,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:24:02,627 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 15:24:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:24:02,678 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2018-11-23 15:24:02,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:24:02,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2018-11-23 15:24:02,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 15:24:02,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 38 transitions. [2018-11-23 15:24:02,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 15:24:02,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 15:24:02,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2018-11-23 15:24:02,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:24:02,680 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-23 15:24:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2018-11-23 15:24:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-11-23 15:24:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 15:24:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-23 15:24:02,682 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 15:24:02,682 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 15:24:02,682 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:24:02,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-23 15:24:02,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 15:24:02,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:24:02,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:24:02,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:24:02,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 15:24:02,684 INFO L794 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 230#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 231#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 247#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 249#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2018-11-23 15:24:02,684 INFO L796 eck$LassoCheckResult]: Loop: 239#L552-2 assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 252#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 235#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 244#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 238#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2018-11-23 15:24:02,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:02,684 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2018-11-23 15:24:02,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:02,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:02,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash 48745190, now seen corresponding path program 1 times [2018-11-23 15:24:02,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:02,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:02,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:24:02,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:02,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:24:02,707 INFO L82 PathProgramCache]: Analyzing trace with hash 707540352, now seen corresponding path program 1 times [2018-11-23 15:24:02,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:24:02,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:24:02,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:24:02,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:24:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:24:03,017 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; [?] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; [?] assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset; [L549] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4); [L549] main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L550] call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4); [L550] havoc main_#t~nondet3; [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset; [L549] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4); [L549] main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L550] call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4); [L550] havoc main_#t~nondet3; [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0; [L549] FCALL call main_#t~malloc2 := #Ultimate.alloc(4); [L549] main_~x~0 := main_#t~malloc2; [L550] FCALL call write~int(main_#t~nondet3, main_~x~0, 4); [L550] havoc main_#t~nondet3; [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0; [L549] FCALL call main_#t~malloc2 := #Ultimate.alloc(4); [L549] main_~x~0 := main_#t~malloc2; [L550] FCALL call write~int(main_#t~nondet3, main_~x~0, 4); [L550] havoc main_#t~nondet3; [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L549] ~x~0 := #t~malloc2; [L550] FCALL call write~int(#t~nondet3, ~x~0, 4); [L550] havoc #t~nondet3; [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L549] ~x~0 := #t~malloc2; [L550] FCALL call write~int(#t~nondet3, ~x~0, 4); [L550] havoc #t~nondet3; [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [?] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; [?] assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; [L552-L564] assume main_#t~short7; [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L553-L561] assume main_#t~mem8 < 0; [L553] havoc main_#t~mem8; [L554] call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L552-L564] assume main_#t~short7; [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L553-L561] assume main_#t~mem8 < 0; [L553] havoc main_#t~mem8; [L554] call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [L552] COND TRUE main_#t~short7 [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] FCALL call main_#t~mem8 := read~int(main_~x~0, 4); [L553] COND TRUE main_#t~mem8 < 0 [L553] havoc main_#t~mem8; [L554] FCALL call write~int(-5, main_~x~0, 4); [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L552] COND TRUE main_#t~short7 [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] FCALL call main_#t~mem8 := read~int(main_~x~0, 4); [L553] COND TRUE main_#t~mem8 < 0 [L553] havoc main_#t~mem8; [L554] FCALL call write~int(-5, main_~x~0, 4); [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [L552] COND TRUE #t~short7 [L552] havoc #t~mem5; [L552] havoc #t~short7; [L552] havoc #t~mem6; [L553] FCALL call #t~mem8 := read~int(~x~0, 4); [L553] COND TRUE #t~mem8 < 0 [L553] havoc #t~mem8; [L554] FCALL call write~int(-5, ~x~0, 4); [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L552] COND TRUE #t~short7 [L552] havoc #t~mem5; [L552] havoc #t~short7; [L552] havoc #t~mem6; [L553] FCALL call #t~mem8 := read~int(~x~0, 4); [L553] COND TRUE #t~mem8 < 0 [L553] havoc #t~mem8; [L554] FCALL call write~int(-5, ~x~0, 4); [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 ----- [2018-11-23 15:24:03,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:24:03 BoogieIcfgContainer [2018-11-23 15:24:03,038 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:24:03,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:24:03,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:24:03,038 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:24:03,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:24:01" (3/4) ... [2018-11-23 15:24:03,040 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; [?] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; [?] assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset; [L549] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4); [L549] main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L550] call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4); [L550] havoc main_#t~nondet3; [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset; [L549] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4); [L549] main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L550] call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4); [L550] havoc main_#t~nondet3; [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0; [L549] FCALL call main_#t~malloc2 := #Ultimate.alloc(4); [L549] main_~x~0 := main_#t~malloc2; [L550] FCALL call write~int(main_#t~nondet3, main_~x~0, 4); [L550] havoc main_#t~nondet3; [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0; [L549] FCALL call main_#t~malloc2 := #Ultimate.alloc(4); [L549] main_~x~0 := main_#t~malloc2; [L550] FCALL call write~int(main_#t~nondet3, main_~x~0, 4); [L550] havoc main_#t~nondet3; [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L549] ~x~0 := #t~malloc2; [L550] FCALL call write~int(#t~nondet3, ~x~0, 4); [L550] havoc #t~nondet3; [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L549] ~x~0 := #t~malloc2; [L550] FCALL call write~int(#t~nondet3, ~x~0, 4); [L550] havoc #t~nondet3; [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [?] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; [?] assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; [L552-L564] assume main_#t~short7; [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L553-L561] assume main_#t~mem8 < 0; [L553] havoc main_#t~mem8; [L554] call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L552-L564] assume main_#t~short7; [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L553-L561] assume main_#t~mem8 < 0; [L553] havoc main_#t~mem8; [L554] call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [L552] COND TRUE main_#t~short7 [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] FCALL call main_#t~mem8 := read~int(main_~x~0, 4); [L553] COND TRUE main_#t~mem8 < 0 [L553] havoc main_#t~mem8; [L554] FCALL call write~int(-5, main_~x~0, 4); [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L552] COND TRUE main_#t~short7 [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] FCALL call main_#t~mem8 := read~int(main_~x~0, 4); [L553] COND TRUE main_#t~mem8 < 0 [L553] havoc main_#t~mem8; [L554] FCALL call write~int(-5, main_~x~0, 4); [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [L552] COND TRUE #t~short7 [L552] havoc #t~mem5; [L552] havoc #t~short7; [L552] havoc #t~mem6; [L553] FCALL call #t~mem8 := read~int(~x~0, 4); [L553] COND TRUE #t~mem8 < 0 [L553] havoc #t~mem8; [L554] FCALL call write~int(-5, ~x~0, 4); [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L552] COND TRUE #t~short7 [L552] havoc #t~mem5; [L552] havoc #t~short7; [L552] havoc #t~mem6; [L553] FCALL call #t~mem8 := read~int(~x~0, 4); [L553] COND TRUE #t~mem8 < 0 [L553] havoc #t~mem8; [L554] FCALL call write~int(-5, ~x~0, 4); [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 ----- [2018-11-23 15:24:03,078 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7df551a2-52ed-48cc-855d-a0f3801d6f57/bin-2019/uautomizer/witness.graphml [2018-11-23 15:24:03,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:24:03,078 INFO L168 Benchmark]: Toolchain (without parser) took 2239.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:24:03,079 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:24:03,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:24:03,079 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:24:03,080 INFO L168 Benchmark]: Boogie Preprocessor took 18.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:24:03,080 INFO L168 Benchmark]: RCFGBuilder took 205.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:24:03,080 INFO L168 Benchmark]: BuchiAutomizer took 1623.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.9 MB). Peak memory consumption was 238.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:24:03,081 INFO L168 Benchmark]: Witness Printer took 39.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:24:03,083 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 205.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1623.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.9 MB). Peak memory consumption was 238.3 MB. Max. memory is 11.5 GB. * Witness Printer took 39.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 16 SDslu, 27 SDs, 0 SdLazy, 75 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital90 mio100 ax120 hnf100 lsp77 ukn72 mio100 lsp40 div100 bol100 ite100 ukn100 eq179 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 552]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7db25dd5=3, NULL=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ec3820=0, NULL=0, x=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7db25dd5=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@26acb7eb=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@61a94fb2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@59f3da7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@17833ee5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@23a472d9=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2ed4926=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@78eebccb=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 552]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; [?] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; [?] assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset; [L549] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4); [L549] main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L550] call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4); [L550] havoc main_#t~nondet3; [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset; [L549] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4); [L549] main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L550] call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4); [L550] havoc main_#t~nondet3; [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0; [L549] FCALL call main_#t~malloc2 := #Ultimate.alloc(4); [L549] main_~x~0 := main_#t~malloc2; [L550] FCALL call write~int(main_#t~nondet3, main_~x~0, 4); [L550] havoc main_#t~nondet3; [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0; [L549] FCALL call main_#t~malloc2 := #Ultimate.alloc(4); [L549] main_~x~0 := main_#t~malloc2; [L550] FCALL call write~int(main_#t~nondet3, main_~x~0, 4); [L550] havoc main_#t~nondet3; [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L549] ~x~0 := #t~malloc2; [L550] FCALL call write~int(#t~nondet3, ~x~0, 4); [L550] havoc #t~nondet3; [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L549] ~x~0 := #t~malloc2; [L550] FCALL call write~int(#t~nondet3, ~x~0, 4); [L550] havoc #t~nondet3; [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [?] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; [?] assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; [L552-L564] assume main_#t~short7; [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L553-L561] assume main_#t~mem8 < 0; [L553] havoc main_#t~mem8; [L554] call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L552-L564] assume main_#t~short7; [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L553-L561] assume main_#t~mem8 < 0; [L553] havoc main_#t~mem8; [L554] call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [L552] COND TRUE main_#t~short7 [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] FCALL call main_#t~mem8 := read~int(main_~x~0, 4); [L553] COND TRUE main_#t~mem8 < 0 [L553] havoc main_#t~mem8; [L554] FCALL call write~int(-5, main_~x~0, 4); [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L552] COND TRUE main_#t~short7 [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] FCALL call main_#t~mem8 := read~int(main_~x~0, 4); [L553] COND TRUE main_#t~mem8 < 0 [L553] havoc main_#t~mem8; [L554] FCALL call write~int(-5, main_~x~0, 4); [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [L552] COND TRUE #t~short7 [L552] havoc #t~mem5; [L552] havoc #t~short7; [L552] havoc #t~mem6; [L553] FCALL call #t~mem8 := read~int(~x~0, 4); [L553] COND TRUE #t~mem8 < 0 [L553] havoc #t~mem8; [L554] FCALL call write~int(-5, ~x~0, 4); [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L552] COND TRUE #t~short7 [L552] havoc #t~mem5; [L552] havoc #t~short7; [L552] havoc #t~mem6; [L553] FCALL call #t~mem8 := read~int(~x~0, 4); [L553] COND TRUE #t~mem8 < 0 [L553] havoc #t~mem8; [L554] FCALL call write~int(-5, ~x~0, 4); [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; [?] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; [?] assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset; [L549] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4); [L549] main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L550] call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4); [L550] havoc main_#t~nondet3; [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset; [L549] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4); [L549] main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L550] call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4); [L550] havoc main_#t~nondet3; [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0; [L549] FCALL call main_#t~malloc2 := #Ultimate.alloc(4); [L549] main_~x~0 := main_#t~malloc2; [L550] FCALL call write~int(main_#t~nondet3, main_~x~0, 4); [L550] havoc main_#t~nondet3; [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0; [L549] FCALL call main_#t~malloc2 := #Ultimate.alloc(4); [L549] main_~x~0 := main_#t~malloc2; [L550] FCALL call write~int(main_#t~nondet3, main_~x~0, 4); [L550] havoc main_#t~nondet3; [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L549] ~x~0 := #t~malloc2; [L550] FCALL call write~int(#t~nondet3, ~x~0, 4); [L550] havoc #t~nondet3; [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L549] ~x~0 := #t~malloc2; [L550] FCALL call write~int(#t~nondet3, ~x~0, 4); [L550] havoc #t~nondet3; [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume main_#t~short7;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [?] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [?] assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; [?] assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; [L552-L564] assume main_#t~short7; [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L553-L561] assume main_#t~mem8 < 0; [L553] havoc main_#t~mem8; [L554] call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L552-L564] assume main_#t~short7; [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L553-L561] assume main_#t~mem8 < 0; [L553] havoc main_#t~mem8; [L554] call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); [L551] call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L551-L565] assume !!(0 != main_#t~mem4); [L551] havoc main_#t~mem4; [L552] call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] assume main_#t~short7; [L552] call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [L552] COND TRUE main_#t~short7 [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] FCALL call main_#t~mem8 := read~int(main_~x~0, 4); [L553] COND TRUE main_#t~mem8 < 0 [L553] havoc main_#t~mem8; [L554] FCALL call write~int(-5, main_~x~0, 4); [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L552] COND TRUE main_#t~short7 [L552] havoc main_#t~mem5; [L552] havoc main_#t~short7; [L552] havoc main_#t~mem6; [L553] FCALL call main_#t~mem8 := read~int(main_~x~0, 4); [L553] COND TRUE main_#t~mem8 < 0 [L553] havoc main_#t~mem8; [L554] FCALL call write~int(-5, main_~x~0, 4); [L551] FCALL call main_#t~mem4 := read~int(main_~x~0, 4); [L551-L565] COND FALSE !(!(0 != main_#t~mem4)) [L551] havoc main_#t~mem4; [L552] FCALL call main_#t~mem5 := read~int(main_~x~0, 4); [L552] main_#t~short7 := -5 <= main_#t~mem5; [L552] COND TRUE main_#t~short7 [L552] FCALL call main_#t~mem6 := read~int(main_~x~0, 4); [L552] main_#t~short7 := main_#t~mem6 <= 35; [L552] COND TRUE #t~short7 [L552] havoc #t~mem5; [L552] havoc #t~short7; [L552] havoc #t~mem6; [L553] FCALL call #t~mem8 := read~int(~x~0, 4); [L553] COND TRUE #t~mem8 < 0 [L553] havoc #t~mem8; [L554] FCALL call write~int(-5, ~x~0, 4); [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L552] COND TRUE #t~short7 [L552] havoc #t~mem5; [L552] havoc #t~short7; [L552] havoc #t~mem6; [L553] FCALL call #t~mem8 := read~int(~x~0, 4); [L553] COND TRUE #t~mem8 < 0 [L553] havoc #t~mem8; [L554] FCALL call write~int(-5, ~x~0, 4); [L551] FCALL call #t~mem4 := read~int(~x~0, 4); [L551-L565] COND FALSE !(!(0 != #t~mem4)) [L551] havoc #t~mem4; [L552] FCALL call #t~mem5 := read~int(~x~0, 4); [L552] #t~short7 := -5 <= #t~mem5; [L552] COND TRUE #t~short7 [L552] FCALL call #t~mem6 := read~int(~x~0, 4); [L552] #t~short7 := #t~mem6 <= 35; [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 Loop: [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...