./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/stroeder1-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/stroeder1-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/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 32bit --witnessprinter.graph.data.programhash 1643f1caf494dad598b4df826effeedd3e612fb8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:11,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:11,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:11,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:11,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:11,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:11,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:11,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:11,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:11,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:11,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:11,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:11,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:11,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:11,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:11,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:11,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:11,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:11,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:11,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:11,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:11,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:11,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:11,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:11,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:11,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:11,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:11,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:11,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:11,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:11,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:11,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:11,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:11,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:11,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:11,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:11,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:11,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:11,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:11,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:11,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:11,997 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:56:12,009 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:12,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:12,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:12,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:12,011 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:12,011 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:12,011 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:12,011 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:12,011 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:12,011 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:12,012 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:12,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:12,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:12,012 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:12,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:12,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:12,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:12,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:12,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:12,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:12,013 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:12,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:12,014 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:12,014 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:12,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:12,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:12,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:12,015 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:12,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:12,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:12,015 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:12,016 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:12,016 INFO L138 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_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1643f1caf494dad598b4df826effeedd3e612fb8 [2019-10-22 08:56:12,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:12,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:12,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:12,054 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:12,054 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:12,055 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/stroeder1-alloca-1.i [2019-10-22 08:56:12,102 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/uautomizer/data/82decafe3/86fdb48eca4a47309193fee984a2a07f/FLAG9148e3c59 [2019-10-22 08:56:12,535 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:12,539 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/sv-benchmarks/c/array-memsafety/stroeder1-alloca-1.i [2019-10-22 08:56:12,556 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/uautomizer/data/82decafe3/86fdb48eca4a47309193fee984a2a07f/FLAG9148e3c59 [2019-10-22 08:56:12,894 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/uautomizer/data/82decafe3/86fdb48eca4a47309193fee984a2a07f [2019-10-22 08:56:12,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:12,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:12,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:12,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:12,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:12,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:12" (1/1) ... [2019-10-22 08:56:12,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b053f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:12, skipping insertion in model container [2019-10-22 08:56:12,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:12" (1/1) ... [2019-10-22 08:56:12,911 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:12,955 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:13,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:13,291 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:13,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:13,388 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:13,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13 WrapperNode [2019-10-22 08:56:13,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:13,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:13,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:13,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:13,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:13,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:13,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:13,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:13,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:13,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:13,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:13,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:13,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28ba80a9-05e7-4ce7-bfd9-5b78172add13/bin/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 [2019-10-22 08:56:13,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:13,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:13,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:13,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:13,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:13,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:13,741 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:13,742 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:56:13,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:13 BoogieIcfgContainer [2019-10-22 08:56:13,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:13,744 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:13,744 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:13,747 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:13,748 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:13,748 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:12" (1/3) ... [2019-10-22 08:56:13,749 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fba0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:13, skipping insertion in model container [2019-10-22 08:56:13,749 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:13,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (2/3) ... [2019-10-22 08:56:13,749 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fba0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:13, skipping insertion in model container [2019-10-22 08:56:13,750 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:13,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:13" (3/3) ... [2019-10-22 08:56:13,751 INFO L371 chiAutomizerObserver]: Analyzing ICFG stroeder1-alloca-1.i [2019-10-22 08:56:13,789 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:13,789 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:13,789 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:13,789 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:13,790 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:13,790 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:13,790 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:13,790 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:13,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:56:13,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:56:13,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:13,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:13,829 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:56:13,829 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:13,830 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:13,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:56:13,831 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:56:13,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:13,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:13,831 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:56:13,831 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:13,836 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~1, main_#t~ret8, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet4;havoc main_#t~nondet4; 3#L526true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7#L526-2true call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~1 := 0; 14#L531-3true [2019-10-22 08:56:13,836 INFO L793 eck$LassoCheckResult]: Loop: 14#L531-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet7, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet7; 13#L531-2true main_#t~post6 := main_~i~1;main_~i~1 := 1 + main_#t~post6;havoc main_#t~post6; 14#L531-3true [2019-10-22 08:56:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,840 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 08:56:13,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596450320] [2019-10-22 08:56:13,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,944 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:13,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 08:56:13,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455269008] [2019-10-22 08:56:13,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,964 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:13,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 08:56:13,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898061927] [2019-10-22 08:56:13,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,014 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:14,163 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:14,164 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:14,164 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:14,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:14,164 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:14,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:14,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:14,164 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:14,165 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder1-alloca-1.i_Iteration1_Lasso [2019-10-22 08:56:14,165 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:14,165 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:14,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:14,592 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:14,597 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:14,599 INFO L120 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 [2019-10-22 08:56:14,600 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,600 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,601 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,603 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,604 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,607 INFO L120 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 [2019-10-22 08:56:14,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,608 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,608 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,608 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,608 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,609 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,610 INFO L120 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 [2019-10-22 08:56:14,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,611 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,611 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,612 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,612 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,613 INFO L120 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 [2019-10-22 08:56:14,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,621 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:14,621 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:14,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,626 INFO L120 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 [2019-10-22 08:56:14,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,645 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:14,646 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:14,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,650 INFO L120 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 [2019-10-22 08:56:14,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:14,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,651 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:14,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:14,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:14,653 INFO L120 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 [2019-10-22 08:56:14,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:14,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:14,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:14,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:14,664 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:14,664 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:14,745 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:14,813 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:56:14,815 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:56:14,817 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:14,819 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 08:56:14,820 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:14,821 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1, ULTIMATE.start_main_~i~1) = 1073741819*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [-1*ULTIMATE.start_main_~array_size~0 + 536870910 >= 0] [2019-10-22 08:56:14,837 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:56:14,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:14,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:56:14,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:14,927 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:56:14,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:14,966 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-10-22 08:56:14,967 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2019-10-22 08:56:15,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 4 states. Result 32 states and 42 transitions. Complement of second has 8 states. [2019-10-22 08:56:15,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2019-10-22 08:56:15,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:56:15,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:15,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:56:15,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:15,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 08:56:15,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:15,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2019-10-22 08:56:15,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:15,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 10 states and 13 transitions. [2019-10-22 08:56:15,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:56:15,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:56:15,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-10-22 08:56:15,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:15,068 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:56:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-10-22 08:56:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-10-22 08:56:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:56:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-10-22 08:56:15,095 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:56:15,095 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:56:15,095 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:15,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-10-22 08:56:15,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:15,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:15,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:15,096 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:15,096 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:15,097 INFO L791 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 114#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~1, main_#t~ret8, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet4;havoc main_#t~nondet4; 115#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 116#L526-2 call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~1 := 0; 120#L531-3 assume !(main_~i~1 < main_~array_size~0); 123#L531-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 119#L517-3 [2019-10-22 08:56:15,097 INFO L793 eck$LassoCheckResult]: Loop: 119#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset;call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_~sum~0 := sumOfThirdBytes_~sum~0 + sumOfThirdBytes_#t~mem3;havoc sumOfThirdBytes_#t~mem3; 118#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 119#L517-3 [2019-10-22 08:56:15,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-10-22 08:56:15,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777505317] [2019-10-22 08:56:15,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:15,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777505317] [2019-10-22 08:56:15,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:15,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:15,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244051109] [2019-10-22 08:56:15,161 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2019-10-22 08:56:15,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728336436] [2019-10-22 08:56:15,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,177 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:15,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:15,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:15,231 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:56:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:15,260 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-10-22 08:56:15,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:15,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-10-22 08:56:15,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:15,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-10-22 08:56:15,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:56:15,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:56:15,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-10-22 08:56:15,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:15,264 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-10-22 08:56:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-10-22 08:56:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-10-22 08:56:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:56:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-10-22 08:56:15,266 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-10-22 08:56:15,266 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-10-22 08:56:15,266 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:15,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-10-22 08:56:15,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:15,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:15,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:15,268 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:15,268 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:15,268 INFO L791 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 142#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet7, main_#t~post6, main_~i~1, main_#t~ret8, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet4;havoc main_#t~nondet4; 143#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 144#L526-2 call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;main_~i~1 := 0; 148#L531-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet7, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet7; 149#L531-2 main_#t~post6 := main_~i~1;main_~i~1 := 1 + main_#t~post6;havoc main_#t~post6; 150#L531-3 assume !(main_~i~1 < main_~array_size~0); 151#L531-4 sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~mem3, sumOfThirdBytes_#t~post2, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; 147#L517-3 [2019-10-22 08:56:15,268 INFO L793 eck$LassoCheckResult]: Loop: 147#L517-3 assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset;call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_~sum~0 := sumOfThirdBytes_~sum~0 + sumOfThirdBytes_#t~mem3;havoc sumOfThirdBytes_#t~mem3; 146#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 147#L517-3 [2019-10-22 08:56:15,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,269 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-10-22 08:56:15,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907319765] [2019-10-22 08:56:15,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,303 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2019-10-22 08:56:15,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989289675] [2019-10-22 08:56:15,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,325 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2019-10-22 08:56:15,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789836279] [2019-10-22 08:56:15,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:15,367 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:15,573 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-10-22 08:56:15,637 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:15,637 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:15,637 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:15,637 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:15,638 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:15,638 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:15,638 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:15,638 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:15,638 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder1-alloca-1.i_Iteration3_Lasso [2019-10-22 08:56:15,638 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:15,638 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:15,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:15,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:16,095 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:16,095 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:16,095 INFO L120 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 [2019-10-22 08:56:16,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,097 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,098 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,098 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,099 INFO L120 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 [2019-10-22 08:56:16,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,100 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,100 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,102 INFO L120 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 [2019-10-22 08:56:16,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,102 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,103 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,103 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,104 INFO L120 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 [2019-10-22 08:56:16,105 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,107 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:16,107 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,109 INFO L120 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 [2019-10-22 08:56:16,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,111 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,111 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,112 INFO L120 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 [2019-10-22 08:56:16,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,114 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:16,114 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,117 INFO L120 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 [2019-10-22 08:56:16,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,118 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:56:16,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,121 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:56:16,121 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,136 INFO L120 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 [2019-10-22 08:56:16,137 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:16,151 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,154 INFO L120 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 [2019-10-22 08:56:16,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,159 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:16,159 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,204 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:16,237 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:56:16,237 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-10-22 08:56:16,238 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:16,240 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:16,240 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:16,240 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sumOfThirdBytes_~array_size, ULTIMATE.start_sumOfThirdBytes_~i~0) = 1*ULTIMATE.start_sumOfThirdBytes_~array_size - 1*ULTIMATE.start_sumOfThirdBytes_~i~0 Supporting invariants [] [2019-10-22 08:56:16,243 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:56:16,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:16,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:16,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:16,283 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 [2019-10-22 08:56:16,284 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 08:56:16,291 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 12 states and 15 transitions. Complement of second has 4 states. [2019-10-22 08:56:16,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-10-22 08:56:16,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2019-10-22 08:56:16,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:16,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2019-10-22 08:56:16,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:16,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 4 letters. [2019-10-22 08:56:16,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:16,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2019-10-22 08:56:16,294 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:16,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-10-22 08:56:16,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:56:16,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:56:16,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:56:16,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:16,295 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:16,295 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:16,295 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:16,295 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:16,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:16,295 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:16,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:56:16,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:16 BoogieIcfgContainer [2019-10-22 08:56:16,301 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:16,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:16,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:16,302 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:16,303 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:13" (3/4) ... [2019-10-22 08:56:16,306 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:16,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:16,307 INFO L168 Benchmark]: Toolchain (without parser) took 3410.44 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.4 MB). Free memory was 943.2 MB in the beginning and 1.2 GB in the end (delta: -243.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:16,307 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:16,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 491.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:16,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:16,308 INFO L168 Benchmark]: Boogie Preprocessor took 23.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:16,309 INFO L168 Benchmark]: RCFGBuilder took 287.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:16,310 INFO L168 Benchmark]: BuchiAutomizer took 2557.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.0 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:16,310 INFO L168 Benchmark]: Witness Printer took 4.07 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:16,312 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 491.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 287.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2557.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.0 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.07 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 1073741819 * unknown-#length-unknown[numbers] + -8 * i and consists of 6 locations. One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 32 SDslu, 17 SDs, 0 SdLazy, 30 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital124 mio100 ax114 hnf98 lsp82 ukn78 mio100 lsp63 div100 bol100 ite100 ukn100 eq174 hnf91 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...