./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array20_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_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array20_alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/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 15cc26ae0dc42c909592f114b7003fa240a2d07d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:52:34,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:52:34,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:52:34,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:52:34,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:52:34,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:52:34,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:52:34,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:52:34,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:52:34,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:52:34,339 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:52:34,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:52:34,340 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:52:34,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:52:34,342 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:52:34,343 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:52:34,343 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:52:34,345 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:52:34,346 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:52:34,347 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:52:34,348 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:52:34,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:52:34,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:52:34,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:52:34,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:52:34,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:52:34,353 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:52:34,353 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:52:34,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:52:34,355 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:52:34,355 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:52:34,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:52:34,356 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:52:34,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:52:34,357 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:52:34,357 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:52:34,357 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:52:34,369 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:52:34,369 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:52:34,370 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:52:34,370 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:52:34,371 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:52:34,371 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:52:34,371 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:52:34,371 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:52:34,371 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:52:34,371 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:52:34,371 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:52:34,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:52:34,372 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:52:34,372 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:52:34,372 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:52:34,372 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:52:34,372 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:52:34,372 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:52:34,372 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:52:34,372 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:52:34,376 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:52:34,376 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:52:34,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:52:34,376 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:52:34,377 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:52:34,377 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:52:34,377 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:52:34,377 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:52:34,378 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:52:34,378 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_d50ab8e3-0458-4915-beb2-a32821966216/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 -> 15cc26ae0dc42c909592f114b7003fa240a2d07d [2018-11-23 15:52:34,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:52:34,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:52:34,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:52:34,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:52:34,417 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:52:34,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array20_alloca_false-termination.c.i [2018-11-23 15:52:34,469 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/data/95b1db496/60b0d14968a045c4857863d5448b2fb2/FLAGba3cb5dc2 [2018-11-23 15:52:34,858 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:52:34,859 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/sv-benchmarks/c/termination-15/array20_alloca_false-termination.c.i [2018-11-23 15:52:34,866 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/data/95b1db496/60b0d14968a045c4857863d5448b2fb2/FLAGba3cb5dc2 [2018-11-23 15:52:35,241 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/data/95b1db496/60b0d14968a045c4857863d5448b2fb2 [2018-11-23 15:52:35,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:52:35,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:52:35,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:52:35,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:52:35,248 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:52:35,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:52:35" (1/1) ... [2018-11-23 15:52:35,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313768a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35, skipping insertion in model container [2018-11-23 15:52:35,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:52:35" (1/1) ... [2018-11-23 15:52:35,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:52:35,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:52:35,494 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:52:35,500 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:52:35,533 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:52:35,640 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:52:35,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35 WrapperNode [2018-11-23 15:52:35,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:52:35,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:52:35,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:52:35,642 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:52:35,650 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:52:35" (1/1) ... [2018-11-23 15:52:35,661 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:52:35" (1/1) ... [2018-11-23 15:52:35,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:52:35,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:52:35,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:52:35,676 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:52:35,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35" (1/1) ... [2018-11-23 15:52:35,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35" (1/1) ... [2018-11-23 15:52:35,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35" (1/1) ... [2018-11-23 15:52:35,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35" (1/1) ... [2018-11-23 15:52:35,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35" (1/1) ... [2018-11-23 15:52:35,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35" (1/1) ... [2018-11-23 15:52:35,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35" (1/1) ... [2018-11-23 15:52:35,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:52:35,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:52:35,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:52:35,696 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:52:35,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/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:52:35,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:52:35,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:52:35,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:52:35,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:52:35,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:52:35,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:52:35,883 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:52:35,884 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 15:52:35,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:52:35 BoogieIcfgContainer [2018-11-23 15:52:35,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:52:35,885 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:52:35,885 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:52:35,888 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:52:35,889 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:52:35,889 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:52:35" (1/3) ... [2018-11-23 15:52:35,890 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6072cb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:52:35, skipping insertion in model container [2018-11-23 15:52:35,890 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:52:35,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:52:35" (2/3) ... [2018-11-23 15:52:35,891 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6072cb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:52:35, skipping insertion in model container [2018-11-23 15:52:35,891 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:52:35,891 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:52:35" (3/3) ... [2018-11-23 15:52:35,892 INFO L375 chiAutomizerObserver]: Analyzing ICFG array20_alloca_false-termination.c.i [2018-11-23 15:52:35,931 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:52:35,932 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:52:35,932 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:52:35,932 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:52:35,932 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:52:35,932 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:52:35,933 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:52:35,933 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:52:35,933 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:52:35,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 15:52:35,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:52:35,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:52:35,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:52:35,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:52:35,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:52:35,969 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:52:35,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 15:52:35,971 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 15:52:35,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:52:35,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:52:35,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:52:35,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:52:35,979 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 15#L367true assume !(main_~length~0 < 1); 4#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 16#L370-3true [2018-11-23 15:52:35,979 INFO L796 eck$LassoCheckResult]: Loop: 16#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 8#L372true assume main_#t~mem209 < 1;havoc main_#t~mem209;call write~int(1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 16#L370-3true [2018-11-23 15:52:35,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-23 15:52:35,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:52:35,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:52:36,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:36,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:36,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:36,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:36,067 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2018-11-23 15:52:36,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:52:36,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:52:36,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:36,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:36,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:36,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2018-11-23 15:52:36,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:52:36,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:52:36,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:36,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:36,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:36,305 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:52:36,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:52:36,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:52:36,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:52:36,306 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:52:36,306 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:52:36,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:52:36,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:52:36,307 INFO L131 ssoRankerPreferences]: Filename of dumped script: array20_alloca_false-termination.c.i_Iteration1_Lasso [2018-11-23 15:52:36,307 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:52:36,307 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:52:36,329 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:52:36,333 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:52:36,335 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:52:36,337 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:52:36,339 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:52:36,342 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:52:36,443 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:52:36,445 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:52:36,448 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:52:36,450 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:52:36,601 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:52:36,604 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:52:36,606 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:52:36,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:52:36,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:52:36,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:52:36,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:52:36,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:52:36,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:52:36,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:52:36,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:52:36,612 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:52:36,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:52:36,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:52:36,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:52:36,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:52:36,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:52:36,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:52:36,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:52:36,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:52:36,615 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:52:36,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:52:36,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:52:36,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:52:36,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:52:36,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:52:36,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:52:36,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:52:36,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:52:36,620 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:52:36,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:52:36,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:52:36,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:52:36,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:52:36,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:52:36,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:52:36,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:52:36,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:52:36,623 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:52:36,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:52:36,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:52:36,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:52:36,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:52:36,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:52:36,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:52:36,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:52:36,632 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:52:36,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:52:36,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:52:36,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:52:36,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:52:36,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:52:36,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:52:36,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:52:36,719 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 15:52:36,719 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 15:52:36,721 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:52:36,722 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:52:36,723 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:52:36,723 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2018-11-23 15:52:36,749 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 15:52:36,754 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:52:36,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:52:36,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:52:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:52:36,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:52:36,810 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:52:36,821 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:52:36,821 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-11-23 15:52:36,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 32 states and 44 transitions. Complement of second has 7 states. [2018-11-23 15:52:36,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:52:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:52:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 15:52:36,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 15:52:36,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:52:36,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-23 15:52:36,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:52:36,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 15:52:36,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:52:36,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 44 transitions. [2018-11-23 15:52:36,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 15:52:36,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 11 states and 15 transitions. [2018-11-23 15:52:36,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 15:52:36,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 15:52:36,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2018-11-23 15:52:36,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:52:36,874 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 15:52:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2018-11-23 15:52:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 15:52:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 15:52:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-23 15:52:36,896 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 15:52:36,896 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 15:52:36,897 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:52:36,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-23 15:52:36,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 15:52:36,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:52:36,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:52:36,898 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:52:36,898 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 15:52:36,898 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 109#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 110#L367 assume !(main_~length~0 < 1); 116#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 117#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 118#L370-3 assume !(main_~i~0 < main_~length~0); 113#L370-4 main_~j~0 := 1; 114#L377-2 [2018-11-23 15:52:36,898 INFO L796 eck$LassoCheckResult]: Loop: 114#L377-2 assume !!(1 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 * main_#t~mem210;havoc main_#t~mem210; 114#L377-2 [2018-11-23 15:52:36,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:36,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2018-11-23 15:52:36,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:52:36,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:52:36,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:36,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:36,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:52:36,939 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:52:36,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:52:36,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:52:36,942 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:52:36,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:36,942 INFO L82 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2018-11-23 15:52:36,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:52:36,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:52:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:36,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:36,944 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:52:36,944 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:52:36,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 15:52:36,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:37,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:52:37,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:52:37,063 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-23 15:52:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:52:37,085 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2018-11-23 15:52:37,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:52:37,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-11-23 15:52:37,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 15:52:37,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2018-11-23 15:52:37,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 15:52:37,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 15:52:37,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-23 15:52:37,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:52:37,089 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-23 15:52:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-23 15:52:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-11-23 15:52:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 15:52:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-23 15:52:37,090 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 15:52:37,090 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 15:52:37,090 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:52:37,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-23 15:52:37,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 15:52:37,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:52:37,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:52:37,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:52:37,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 15:52:37,091 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 141#L367 assume !(main_~length~0 < 1); 147#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 148#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 149#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 142#L372 assume !(main_#t~mem209 < 1);havoc main_#t~mem209; 143#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 150#L370-3 assume !(main_~i~0 < main_~length~0); 144#L370-4 main_~j~0 := 1; 145#L377-2 [2018-11-23 15:52:37,092 INFO L796 eck$LassoCheckResult]: Loop: 145#L377-2 assume !!(1 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 * main_#t~mem210;havoc main_#t~mem210; 145#L377-2 [2018-11-23 15:52:37,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2018-11-23 15:52:37,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:52:37,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:52:37,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:37,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:37,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:37,107 INFO L82 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 2 times [2018-11-23 15:52:37,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:52:37,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:52:37,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:37,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,110 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:52:37,111 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:52:37,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 15:52:37,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:52:37,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 15:52:37,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 15:52:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:37,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:37,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1329989554, now seen corresponding path program 1 times [2018-11-23 15:52:37,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:52:37,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:52:37,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:52:37,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,154 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:52:37,155 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:52:37,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 15:52:37,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:52:37,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:52:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:52:37,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:52:37,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 15:52:37,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:52:37,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:52:37,237 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-23 15:52:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:52:37,295 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-11-23 15:52:37,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:52:37,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2018-11-23 15:52:37,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 15:52:37,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 16 states and 20 transitions. [2018-11-23 15:52:37,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 15:52:37,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-23 15:52:37,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-23 15:52:37,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:52:37,298 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 15:52:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-23 15:52:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-23 15:52:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 15:52:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-23 15:52:37,299 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 15:52:37,299 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 15:52:37,300 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:52:37,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-23 15:52:37,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-23 15:52:37,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:52:37,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:52:37,303 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:52:37,303 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-23 15:52:37,303 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 223#L367 assume !(main_~length~0 < 1); 229#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 230#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 231#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 233#L372 assume !(main_#t~mem209 < 1);havoc main_#t~mem209; 235#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 234#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 224#L372 assume !(main_#t~mem209 < 1);havoc main_#t~mem209; 225#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 232#L370-3 assume !(main_~i~0 < main_~length~0); 226#L370-4 main_~j~0 := 1; 227#L377-2 [2018-11-23 15:52:37,303 INFO L796 eck$LassoCheckResult]: Loop: 227#L377-2 assume !!(1 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 * main_#t~mem210;havoc main_#t~mem210; 227#L377-2 [2018-11-23 15:52:37,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1781949270, now seen corresponding path program 2 times [2018-11-23 15:52:37,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:52:37,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:52:37,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:52:37,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:37,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:37,323 INFO L82 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 3 times [2018-11-23 15:52:37,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:52:37,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:52:37,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:52:37,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,326 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:52:37,327 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:52:37,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 15:52:37,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:52:37,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 15:52:37,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 15:52:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:37,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:52:37,371 INFO L82 PathProgramCache]: Analyzing trace with hash -594147436, now seen corresponding path program 2 times [2018-11-23 15:52:37,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:52:37,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:52:37,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:52:37,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:52:37,376 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 15:52:37,376 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 15:52:37,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d50ab8e3-0458-4915-beb2-a32821966216/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 15:52:37,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:52:37,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:52:37,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 15:52:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:52:37,639 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 ----- 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~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; [?] assume !(main_~length~0 < 1); [?] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [?] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(main_#t~mem209 < 1);havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(main_#t~mem209 < 1);havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !(main_~i~0 < main_~length~0); [?] main_~j~0 := 1; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 1); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 1); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 1; ----- ----- 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~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 1); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(main_#t~mem209 < 1); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 1; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 1) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 1) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 1) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(main_#t~mem209 < 1) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 1; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 1) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 1) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 1) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(#t~mem209 < 1) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 1; [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i