./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/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 9bab22e1292e323c4ece7161b1fbb6aa830af760 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-10 11:48:49,850 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:48:49,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:48:49,859 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:48:49,859 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:48:49,860 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:48:49,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:48:49,862 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:48:49,863 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:48:49,864 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:48:49,865 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:48:49,865 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:48:49,866 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:48:49,866 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:48:49,867 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:48:49,868 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:48:49,869 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:48:49,870 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:48:49,871 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:48:49,873 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:48:49,873 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:48:49,874 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:48:49,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:48:49,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:48:49,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:48:49,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:48:49,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:48:49,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:48:49,879 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:48:49,880 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:48:49,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:48:49,881 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:48:49,881 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:48:49,881 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:48:49,882 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:48:49,882 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:48:49,883 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 11:48:49,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:48:49,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:48:49,896 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:48:49,896 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:48:49,896 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:48:49,897 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:48:49,897 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:48:49,897 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:48:49,897 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:48:49,897 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:48:49,897 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:48:49,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:48:49,898 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:48:49,898 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:48:49,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:48:49,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:48:49,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:48:49,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:48:49,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:48:49,899 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:48:49,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:48:49,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:48:49,899 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:48:49,899 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:48:49,899 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:48:49,899 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:48:49,899 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:48:49,900 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:48:49,900 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_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/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 -> 9bab22e1292e323c4ece7161b1fbb6aa830af760 [2018-11-10 11:48:49,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:48:49,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:48:49,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:48:49,936 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:48:49,936 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:48:49,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i [2018-11-10 11:48:49,978 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/bin-2019/uautomizer/data/946816022/be68375a0b474880b3d2045411991cdb/FLAG9935d0ea4 [2018-11-10 11:48:50,363 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:48:50,364 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca_false-termination.c.i [2018-11-10 11:48:50,375 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/bin-2019/uautomizer/data/946816022/be68375a0b474880b3d2045411991cdb/FLAG9935d0ea4 [2018-11-10 11:48:50,385 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/bin-2019/uautomizer/data/946816022/be68375a0b474880b3d2045411991cdb [2018-11-10 11:48:50,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:48:50,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:48:50,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:48:50,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:48:50,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:48:50,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:48:50" (1/1) ... [2018-11-10 11:48:50,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42725a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50, skipping insertion in model container [2018-11-10 11:48:50,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:48:50" (1/1) ... [2018-11-10 11:48:50,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:48:50,433 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:48:50,615 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:48:50,621 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:48:50,648 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:48:50,672 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:48:50,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50 WrapperNode [2018-11-10 11:48:50,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:48:50,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:48:50,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:48:50,674 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:48:50,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50" (1/1) ... [2018-11-10 11:48:50,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50" (1/1) ... [2018-11-10 11:48:50,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:48:50,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:48:50,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:48:50,752 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:48:50,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50" (1/1) ... [2018-11-10 11:48:50,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50" (1/1) ... [2018-11-10 11:48:50,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50" (1/1) ... [2018-11-10 11:48:50,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50" (1/1) ... [2018-11-10 11:48:50,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50" (1/1) ... [2018-11-10 11:48:50,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50" (1/1) ... [2018-11-10 11:48:50,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50" (1/1) ... [2018-11-10 11:48:50,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:48:50,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:48:50,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:48:50,769 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:48:50,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/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-10 11:48:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:48:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:48:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:48:50,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:48:50,994 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:48:50,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:48:50 BoogieIcfgContainer [2018-11-10 11:48:50,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:48:50,995 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:48:50,995 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:48:50,999 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:48:50,999 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:48:51,000 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:48:50" (1/3) ... [2018-11-10 11:48:51,001 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d90e9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:48:51, skipping insertion in model container [2018-11-10 11:48:51,002 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:48:51,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:48:50" (2/3) ... [2018-11-10 11:48:51,002 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d90e9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:48:51, skipping insertion in model container [2018-11-10 11:48:51,002 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:48:51,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:48:50" (3/3) ... [2018-11-10 11:48:51,004 INFO L375 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca_false-termination.c.i [2018-11-10 11:48:51,061 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:48:51,062 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:48:51,062 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:48:51,062 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:48:51,062 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:48:51,063 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:48:51,063 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:48:51,063 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:48:51,063 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:48:51,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 11:48:51,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 11:48:51,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:48:51,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:48:51,107 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:48:51,108 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:48:51,108 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:48:51,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 11:48:51,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 11:48:51,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:48:51,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:48:51,110 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:48:51,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:48:51,118 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~mem5, main_#t~short6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem3, main_~x~0.base, main_~x~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 27#L560-1true [2018-11-10 11:48:51,118 INFO L795 eck$LassoCheckResult]: Loop: 27#L560-1true assume true; 3#L548-1true SUMMARY for call main_#t~mem3 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L548-1 4#L548-2true assume !!(main_#t~mem3 != 0);havoc main_#t~mem3; 26#L549true SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L549 12#L549-1true main_#t~short6 := -5 <= main_#t~mem4; 13#L549-2true assume !main_#t~short6; 20#L549-6true assume !main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 25#L560true SUMMARY for call write~int(0, main_~x~0.base, main_~x~0.offset, 4); srcloc: L560 27#L560-1true [2018-11-10 11:48:51,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:51,122 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 11:48:51,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:51,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:51,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:51,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:51,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:51,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:51,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1044854452, now seen corresponding path program 1 times [2018-11-10 11:48:51,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:51,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:51,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:51,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash -354292978, now seen corresponding path program 1 times [2018-11-10 11:48:51,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:51,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:51,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:51,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:51,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:51,392 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-10 11:48:51,555 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:48:51,556 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:48:51,556 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:48:51,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:48:51,557 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:48:51,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:48:51,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:48:51,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:48:51,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-10 11:48:51,557 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:48:51,558 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:48:51,579 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-10 11:48:51,583 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-10 11:48:51,585 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-10 11:48:51,704 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-10 11:48:51,712 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-10 11:48:51,715 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-10 11:48:51,716 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-10 11:48:51,718 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-10 11:48:51,721 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-10 11:48:51,722 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-10 11:48:51,724 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-10 11:48:51,726 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-10 11:48:51,728 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-10 11:48:51,730 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-10 11:48:51,956 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:48:51,962 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:48:51,964 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-10 11:48:51,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:51,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:51,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:51,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:51,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:51,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:51,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:51,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:51,972 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-10 11:48:51,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:51,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:51,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:51,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:51,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:51,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:51,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:51,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:51,976 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-10 11:48:51,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:51,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:51,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:51,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:51,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:51,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:51,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:51,985 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-10 11:48:51,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:51,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:51,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:51,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:51,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:48:51,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:52,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:52,013 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-10 11:48:52,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:52,014 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:48:52,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:52,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:52,016 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:48:52,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:48:52,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:48:52,030 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-10 11:48:52,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:48:52,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:48:52,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:48:52,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:48:52,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:48:52,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:48:52,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:48:52,035 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:48:52,039 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:48:52,039 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 11:48:52,041 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:48:52,041 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 11:48:52,042 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:48:52,042 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-10 11:48:52,057 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 11:48:52,062 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:48:52,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:48:52,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:48:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:48:52,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:48:52,167 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-10 11:48:52,184 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 11:48:52,185 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2018-11-10 11:48:52,330 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 93 states and 107 transitions. Complement of second has 14 states. [2018-11-10 11:48:52,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 11:48:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 11:48:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-11-10 11:48:52,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-10 11:48:52,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:48:52,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-10 11:48:52,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:48:52,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-10 11:48:52,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:48:52,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 107 transitions. [2018-11-10 11:48:52,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 11:48:52,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 60 states and 72 transitions. [2018-11-10 11:48:52,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 11:48:52,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 11:48:52,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 72 transitions. [2018-11-10 11:48:52,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:48:52,349 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-10 11:48:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 72 transitions. [2018-11-10 11:48:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2018-11-10 11:48:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 11:48:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2018-11-10 11:48:52,373 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-10 11:48:52,373 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-10 11:48:52,373 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:48:52,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2018-11-10 11:48:52,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 11:48:52,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:48:52,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:48:52,375 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:48:52,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:48:52,375 INFO L793 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~mem5, main_#t~short6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem3, main_~x~0.base, main_~x~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 228#L560-1 assume true; 205#L548-1 SUMMARY for call main_#t~mem3 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L548-1 206#L548-2 assume !!(main_#t~mem3 != 0);havoc main_#t~mem3; 241#L549 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L549 242#L549-1 main_#t~short6 := -5 <= main_#t~mem4; 246#L549-2 assume main_#t~short6; 209#L549-3 [2018-11-10 11:48:52,375 INFO L795 eck$LassoCheckResult]: Loop: 209#L549-3 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L549-3 215#L549-4 main_#t~short6 := main_#t~mem5 <= 35; 210#L549-6 assume !main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 224#L560 SUMMARY for call write~int(0, main_~x~0.base, main_~x~0.offset, 4); srcloc: L560 220#L560-1 assume true; 243#L548-1 SUMMARY for call main_#t~mem3 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L548-1 212#L548-2 assume !!(main_#t~mem3 != 0);havoc main_#t~mem3; 213#L549 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L549 201#L549-1 main_#t~short6 := -5 <= main_#t~mem4; 202#L549-2 assume main_#t~short6; 209#L549-3 [2018-11-10 11:48:52,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:52,376 INFO L82 PathProgramCache]: Analyzing trace with hash 147117193, now seen corresponding path program 1 times [2018-11-10 11:48:52,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:52,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:52,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:52,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:52,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:52,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:52,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1222663127, now seen corresponding path program 1 times [2018-11-10 11:48:52,395 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:52,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:52,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:52,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:52,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:48:52,438 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-10 11:48:52,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:48:52,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:48:52,441 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:48:52,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:48:52,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:48:52,444 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-10 11:48:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:48:52,485 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-10 11:48:52,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:48:52,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 61 transitions. [2018-11-10 11:48:52,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 11:48:52,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 44 states and 51 transitions. [2018-11-10 11:48:52,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-10 11:48:52,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-10 11:48:52,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 51 transitions. [2018-11-10 11:48:52,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:48:52,488 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-10 11:48:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 51 transitions. [2018-11-10 11:48:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-10 11:48:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 11:48:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-10 11:48:52,491 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-10 11:48:52,491 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-10 11:48:52,491 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:48:52,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2018-11-10 11:48:52,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 11:48:52,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:48:52,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:48:52,493 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:48:52,493 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:48:52,493 INFO L793 eck$LassoCheckResult]: Stem: 340#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 334#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem4, main_#t~mem5, main_#t~short6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem3, main_~x~0.base, main_~x~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 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~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 335#L560-1 assume true; 314#L548-1 SUMMARY for call main_#t~mem3 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L548-1 315#L548-2 assume !!(main_#t~mem3 != 0);havoc main_#t~mem3; 321#L549 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L549 310#L549-1 main_#t~short6 := -5 <= main_#t~mem4; 311#L549-2 assume main_#t~short6; 318#L549-3 [2018-11-10 11:48:52,493 INFO L795 eck$LassoCheckResult]: Loop: 318#L549-3 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L549-3 323#L549-4 main_#t~short6 := main_#t~mem5 <= 35; 326#L549-6 assume main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 348#L550 SUMMARY for call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550 346#L550-1 assume main_#t~mem7 < 0;havoc main_#t~mem7; 341#L551 SUMMARY for call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 329#L560-1 assume true; 345#L548-1 SUMMARY for call main_#t~mem3 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L548-1 353#L548-2 assume !!(main_#t~mem3 != 0);havoc main_#t~mem3; 352#L549 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L549 351#L549-1 main_#t~short6 := -5 <= main_#t~mem4; 350#L549-2 assume main_#t~short6; 318#L549-3 [2018-11-10 11:48:52,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash 147117193, now seen corresponding path program 2 times [2018-11-10 11:48:52,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:52,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:52,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:52,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:52,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:52,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:52,505 INFO L82 PathProgramCache]: Analyzing trace with hash 875942890, now seen corresponding path program 1 times [2018-11-10 11:48:52,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:52,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:52,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:52,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:48:52,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:52,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:48:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1844976754, now seen corresponding path program 1 times [2018-11-10 11:48:52,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:48:52,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:48:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:52,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:48:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:48:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:48:52,724 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:52,724 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:52,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:48:52 BoogieIcfgContainer [2018-11-10 11:48:52,735 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:48:52,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:48:52,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:48:52,736 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:48:52,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:48:50" (3/4) ... [2018-11-10 11:48:52,740 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 11:48:52,779 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ca79bb4a-93c6-4f1e-9e99-fa4bd4b5aefc/bin-2019/uautomizer/witness.graphml [2018-11-10 11:48:52,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:48:52,780 INFO L168 Benchmark]: Toolchain (without parser) took 2391.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 956.5 MB in the beginning and 905.0 MB in the end (delta: 51.4 MB). Peak memory consumption was 212.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:52,781 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:48:52,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.47 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:52,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -221.2 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:52,783 INFO L168 Benchmark]: Boogie Preprocessor took 17.10 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-11-10 11:48:52,783 INFO L168 Benchmark]: RCFGBuilder took 225.50 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.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:52,784 INFO L168 Benchmark]: BuchiAutomizer took 1740.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 908.3 MB in the end (delta: 224.2 MB). Peak memory consumption was 224.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:52,784 INFO L168 Benchmark]: Witness Printer took 43.56 ms. Allocated memory is still 1.2 GB. Free memory was 908.3 MB in the beginning and 905.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:48:52,788 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 283.47 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 935.0 MB in the beginning and 1.2 GB in the end (delta: -221.2 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.10 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 225.50 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.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1740.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 908.3 MB in the end (delta: 224.2 MB). Peak memory consumption was 224.2 MB. Max. memory is 11.5 GB. * Witness Printer took 43.56 ms. Allocated memory is still 1.2 GB. Free memory was 908.3 MB in the beginning and 905.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 8 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 44 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 14 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 46 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 41 SDtfs, 57 SDslu, 70 SDs, 0 SdLazy, 61 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax119 hnf100 lsp77 ukn100 mio100 lsp36 div100 bol100 ite100 ukn100 eq190 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms 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: 549]: Nontermination argument in form of an infinite program execution. [2018-11-10 11:48:52,796 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:52,796 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:52,797 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 11:48:52,797 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@4dee8ec8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15adb137=5, NULL=0, \result=0, NULL=0, NULL=4, x=5, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15adb137=0, x=0, NULL=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@70c1e45c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@76f01fa0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@27fac461=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@3dd8ef5e=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@7086dc84=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@995b98a=-5} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 549]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L547] EXPR, FCALL __builtin_alloca (sizeof(int)) [L547] int* x = __builtin_alloca (sizeof(int)); [L548] EXPR, FCALL \read(*x) [L548] COND TRUE *x != 0 [L549] EXPR, FCALL \read(*x) [L549] -5 <= *x && *x <= 35 Loop: [L549] EXPR, FCALL \read(*x) [L549] -5 <= *x && *x <= 35 [L549] COND TRUE -5 <= *x && *x <= 35 [L550] EXPR, FCALL \read(*x) [L550] COND TRUE *x < 0 [L551] FCALL *x = -5 [L548] EXPR, FCALL \read(*x) [L548] COND TRUE *x != 0 [L549] EXPR, FCALL \read(*x) [L549] -5 <= *x && *x <= 35 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...