./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/array19_alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array19_alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/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 1ea3ac03f270ffde8f9fa6679f30ddad451a463f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-10-27 06:11:56,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:56,785 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:56,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:56,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:56,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:56,800 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:56,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:56,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:56,806 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:56,808 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:56,808 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:56,809 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:56,809 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:56,810 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:56,811 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:56,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:56,817 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:56,825 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:56,826 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:56,827 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:56,828 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:56,829 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:56,829 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:56,829 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:56,834 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:56,834 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:56,835 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:56,836 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:56,836 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:56,837 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:56,837 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:56,837 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:56,838 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:56,841 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:56,842 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:56,843 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:11:56,861 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:56,863 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:56,865 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:56,866 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:56,866 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:56,866 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:56,867 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:56,868 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:56,868 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:56,868 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:56,868 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:56,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:56,869 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:56,869 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:56,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:56,869 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:56,869 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:56,869 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:56,869 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:56,870 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:56,870 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:56,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:56,870 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:56,870 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:56,870 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:56,871 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:56,871 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:56,871 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:56,872 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_5ea83b12-8468-4706-8029-8e63e30be692/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 -> 1ea3ac03f270ffde8f9fa6679f30ddad451a463f [2018-10-27 06:11:56,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:56,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:56,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:56,933 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:56,933 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:56,934 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array19_alloca_false-termination.c.i [2018-10-27 06:11:56,983 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/bin-2019/uautomizer/data/fe2a43094/f65838317cbc4abaa404b1ee292d4f20/FLAGac2c1e092 [2018-10-27 06:11:57,430 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:57,430 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/sv-benchmarks/c/termination-15/array19_alloca_false-termination.c.i [2018-10-27 06:11:57,438 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/bin-2019/uautomizer/data/fe2a43094/f65838317cbc4abaa404b1ee292d4f20/FLAGac2c1e092 [2018-10-27 06:11:57,454 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/bin-2019/uautomizer/data/fe2a43094/f65838317cbc4abaa404b1ee292d4f20 [2018-10-27 06:11:57,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:57,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:11:57,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:57,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:57,463 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:57,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:57" (1/1) ... [2018-10-27 06:11:57,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7986da40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57, skipping insertion in model container [2018-10-27 06:11:57,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:57" (1/1) ... [2018-10-27 06:11:57,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:57,514 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:57,763 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:57,772 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:57,809 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:57,861 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:57,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57 WrapperNode [2018-10-27 06:11:57,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:57,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:57,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:57,863 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:57,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57" (1/1) ... [2018-10-27 06:11:57,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57" (1/1) ... [2018-10-27 06:11:57,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:57,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:57,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:57,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:57,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57" (1/1) ... [2018-10-27 06:11:57,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57" (1/1) ... [2018-10-27 06:11:57,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57" (1/1) ... [2018-10-27 06:11:57,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57" (1/1) ... [2018-10-27 06:11:57,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57" (1/1) ... [2018-10-27 06:11:57,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57" (1/1) ... [2018-10-27 06:11:57,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57" (1/1) ... [2018-10-27 06:11:57,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:57,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:57,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:57,995 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:57,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/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-10-27 06:11:58,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:11:58,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:11:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:58,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:58,586 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:58,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:58 BoogieIcfgContainer [2018-10-27 06:11:58,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:58,587 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:11:58,588 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:11:58,590 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:11:58,591 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:58,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:11:57" (1/3) ... [2018-10-27 06:11:58,592 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b5f0cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:58, skipping insertion in model container [2018-10-27 06:11:58,592 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:58,592 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:57" (2/3) ... [2018-10-27 06:11:58,593 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b5f0cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:58, skipping insertion in model container [2018-10-27 06:11:58,593 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:58,593 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:58" (3/3) ... [2018-10-27 06:11:58,595 INFO L375 chiAutomizerObserver]: Analyzing ICFG array19_alloca_false-termination.c.i [2018-10-27 06:11:58,650 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:11:58,651 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:11:58,651 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:11:58,651 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:11:58,651 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:58,652 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:58,652 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:11:58,653 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:58,653 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:11:58,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-10-27 06:11:58,691 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:11:58,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:58,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:58,700 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:58,700 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:58,700 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:11:58,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-10-27 06:11:58,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:11:58,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:58,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:58,703 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:58,703 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:58,710 INFO L793 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, 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; 20#L367true assume !(main_~length~0 < 1); 5#L367-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 17#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 4#L370-4true [2018-10-27 06:11:58,711 INFO L795 eck$LassoCheckResult]: Loop: 4#L370-4true assume true; 18#L370-1true assume !!(main_~i~0 < main_~length~0); 12#L371true SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 14#L371-1true havoc main_#t~nondet208; 21#L370-3true main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 4#L370-4true [2018-10-27 06:11:58,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:58,717 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-10-27 06:11:58,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:58,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:58,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:58,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:58,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash 45961588, now seen corresponding path program 1 times [2018-10-27 06:11:58,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:58,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:58,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:58,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:58,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:58,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1986383444, now seen corresponding path program 1 times [2018-10-27 06:11:58,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:58,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:58,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:58,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:59,018 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:11:59,329 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-10-27 06:11:59,407 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:59,408 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:59,408 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:59,409 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:59,409 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:59,409 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:59,409 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:59,409 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:59,409 INFO L131 ssoRankerPreferences]: Filename of dumped script: array19_alloca_false-termination.c.i_Iteration1_Lasso [2018-10-27 06:11:59,410 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:59,410 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:59,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:59,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:59,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:59,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:59,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-10-27 06:11:59,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:59,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:59,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:59,955 WARN L179 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-10-27 06:12:00,196 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-27 06:12:00,525 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:00,529 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:00,531 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-10-27 06:12:00,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:00,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:00,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:00,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:00,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:00,539 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-10-27 06:12:00,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:00,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:00,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:00,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:00,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:00,542 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-10-27 06:12:00,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:00,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:00,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:00,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:00,551 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-10-27 06:12:00,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:00,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:00,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:00,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:00,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:00,553 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-10-27 06:12:00,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:00,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:00,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:00,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:00,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:00,557 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-10-27 06:12:00,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:00,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:00,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:00,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:00,564 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-10-27 06:12:00,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:00,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:00,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:00,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:00,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:00,567 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-10-27 06:12:00,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:00,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:00,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:00,584 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:00,585 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-10-27 06:12:00,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:00,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:00,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:00,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:00,609 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-10-27 06:12:00,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,615 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:00,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,618 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:00,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:00,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:00,649 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-10-27 06:12:00,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:00,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:00,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:00,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:00,680 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-10-27 06:12:00,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:00,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:00,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:00,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:00,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:00,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:00,763 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:00,814 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:12:00,814 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:12:00,816 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:00,817 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:00,818 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:00,818 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-10-27 06:12:00,882 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:12:00,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:00,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:00,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:01,001 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-10-27 06:12:01,002 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 4 states. [2018-10-27 06:12:01,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 4 states. Result 45 states and 53 transitions. Complement of second has 7 states. [2018-10-27 06:12:01,081 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-10-27 06:12:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:12:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-10-27 06:12:01,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 5 letters. Loop has 5 letters. [2018-10-27 06:12:01,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:01,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 10 letters. Loop has 5 letters. [2018-10-27 06:12:01,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:01,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 5 letters. Loop has 10 letters. [2018-10-27 06:12:01,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:01,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 53 transitions. [2018-10-27 06:12:01,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:12:01,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 17 states and 20 transitions. [2018-10-27 06:12:01,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-10-27 06:12:01,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-10-27 06:12:01,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-10-27 06:12:01,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:01,095 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-10-27 06:12:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-10-27 06:12:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-27 06:12:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-27 06:12:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-10-27 06:12:01,120 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-10-27 06:12:01,120 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-10-27 06:12:01,120 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:12:01,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-10-27 06:12:01,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:12:01,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:01,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:01,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:01,122 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:12:01,122 INFO L793 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, 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; 145#L367 assume !(main_~length~0 < 1); 139#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 140#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 133#L370-4 assume true; 135#L370-1 assume !(main_~i~0 < main_~length~0); 137#L370-5 main_~j~0 := 0; 138#L374-3 [2018-10-27 06:12:01,122 INFO L795 eck$LassoCheckResult]: Loop: 138#L374-3 assume true; 143#L374-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 141#L375 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L375 142#L375-1 main_~j~0 := main_~j~0 + (main_#t~mem209 + 1);havoc main_#t~mem209; 138#L374-3 [2018-10-27 06:12:01,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:01,122 INFO L82 PathProgramCache]: Analyzing trace with hash 176703699, now seen corresponding path program 1 times [2018-10-27 06:12:01,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:01,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:01,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:01,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:01,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:01,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:01,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:12:01,181 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:12:01,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2006952, now seen corresponding path program 1 times [2018-10-27 06:12:01,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:01,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:01,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:01,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:01,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:01,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:12:01,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:12:01,266 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:12:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:01,288 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-10-27 06:12:01,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:12:01,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2018-10-27 06:12:01,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:12:01,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 23 transitions. [2018-10-27 06:12:01,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-10-27 06:12:01,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-10-27 06:12:01,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2018-10-27 06:12:01,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:01,292 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-27 06:12:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2018-10-27 06:12:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-10-27 06:12:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-27 06:12:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-10-27 06:12:01,294 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-10-27 06:12:01,294 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-10-27 06:12:01,294 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:12:01,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-10-27 06:12:01,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-10-27 06:12:01,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:01,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:01,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:01,295 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:12:01,295 INFO L793 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, 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; 191#L367 assume !(main_~length~0 < 1); 183#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 184#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 179#L370-4 assume true; 180#L370-1 assume !!(main_~i~0 < main_~length~0); 192#L371 SUMMARY for call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L371 193#L371-1 havoc main_#t~nondet208; 195#L370-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 181#L370-4 assume true; 182#L370-1 assume !(main_~i~0 < main_~length~0); 185#L370-5 main_~j~0 := 0; 186#L374-3 [2018-10-27 06:12:01,296 INFO L795 eck$LassoCheckResult]: Loop: 186#L374-3 assume true; 189#L374-1 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); 187#L375 SUMMARY for call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L375 188#L375-1 main_~j~0 := main_~j~0 + (main_#t~mem209 + 1);havoc main_#t~mem209; 186#L374-3 [2018-10-27 06:12:01,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:01,296 INFO L82 PathProgramCache]: Analyzing trace with hash -289757936, now seen corresponding path program 1 times [2018-10-27 06:12:01,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:01,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:01,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:01,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2006952, now seen corresponding path program 2 times [2018-10-27 06:12:01,323 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:01,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:01,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:01,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:01,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:01,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:01,333 INFO L82 PathProgramCache]: Analyzing trace with hash 399648055, now seen corresponding path program 1 times [2018-10-27 06:12:01,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:01,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:01,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:01,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:01,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:01,595 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-10-27 06:12:01,658 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:12:01,659 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:12:01,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:12:01 BoogieIcfgContainer [2018-10-27 06:12:01,675 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:12:01,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:12:01,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:12:01,675 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:12:01,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:58" (3/4) ... [2018-10-27 06:12:01,683 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-10-27 06:12:01,748 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5ea83b12-8468-4706-8029-8e63e30be692/bin-2019/uautomizer/witness.graphml [2018-10-27 06:12:01,748 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:12:01,749 INFO L168 Benchmark]: Toolchain (without parser) took 4290.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 955.7 MB in the beginning and 926.9 MB in the end (delta: 28.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:01,749 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:01,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.84 ms. Allocated memory is still 1.0 GB. Free memory was 955.7 MB in the beginning and 928.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:01,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 928.9 MB in the beginning and 1.2 GB in the end (delta: -235.0 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:01,752 INFO L168 Benchmark]: Boogie Preprocessor took 23.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:12:01,752 INFO L168 Benchmark]: RCFGBuilder took 593.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:01,752 INFO L168 Benchmark]: BuchiAutomizer took 3087.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 206.7 MB). Peak memory consumption was 206.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:01,753 INFO L168 Benchmark]: Witness Printer took 72.99 ms. Allocated memory is still 1.2 GB. Free memory was 933.7 MB in the beginning and 926.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:12:01,758 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.84 ms. Allocated memory is still 1.0 GB. Free memory was 955.7 MB in the beginning and 928.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 928.9 MB in the beginning and 1.2 GB in the end (delta: -235.0 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 593.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3087.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.7 MB in the end (delta: 206.7 MB). Peak memory consumption was 206.7 MB. Max. memory is 11.5 GB. * Witness Printer took 72.99 ms. Allocated memory is still 1.2 GB. Free memory was 933.7 MB in the beginning and 926.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 43 SDslu, 24 SDs, 0 SdLazy, 29 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital110 mio100 ax100 hnf99 lsp94 ukn97 mio100 lsp54 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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: 374]: Nontermination argument in form of an infinite program execution. [2018-10-27 06:12:01,766 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:12:01,770 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:12:01,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:12:01,771 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {NULL=0, \result=0, arr=2, arr=0, i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@434d1d0a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15638452=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3cd8aaed=0, length=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@3b8b9346=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3cd8aaed=2, j=0, NULL=0, NULL=4, NULL=0, NULL=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@690bf3b8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 374]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] EXPR, FCALL __builtin_alloca(length*sizeof(int)) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i