./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/stroeder2-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_eca3ac66-dc27-4a3f-b826-25c8615a518a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/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 fa1df4216228ace3c3c1088507575f9600e9db06 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:02:34,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:34,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:34,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:34,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:34,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:34,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:34,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:34,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:34,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:34,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:34,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:34,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:34,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:34,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:34,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:34,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:34,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:34,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:34,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:35,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:35,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:35,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:35,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:35,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:35,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:35,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:35,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:35,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:35,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:35,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:35,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:35,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:35,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:35,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:35,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:35,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:35,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:35,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:35,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:35,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:35,021 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:02:35,033 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:35,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:35,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:35,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:35,035 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:35,035 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:35,035 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:35,035 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:35,036 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:35,036 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:35,036 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:35,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:35,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:35,036 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:35,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:35,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:35,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:35,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:35,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:35,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:35,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:35,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:35,037 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:35,038 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:35,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:35,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:35,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:35,039 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:35,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:35,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:35,039 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:35,040 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:35,040 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_eca3ac66-dc27-4a3f-b826-25c8615a518a/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 -> fa1df4216228ace3c3c1088507575f9600e9db06 [2019-10-22 09:02:35,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:35,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:35,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:35,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:35,075 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:35,075 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2019-10-22 09:02:35,122 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/bin/uautomizer/data/c2e993b88/2f8e8836d184407c99b2d0183062c3dd/FLAGf08b14867 [2019-10-22 09:02:35,574 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:35,575 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/sv-benchmarks/c/array-memsafety/stroeder2-alloca-1.i [2019-10-22 09:02:35,590 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/bin/uautomizer/data/c2e993b88/2f8e8836d184407c99b2d0183062c3dd/FLAGf08b14867 [2019-10-22 09:02:35,605 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/bin/uautomizer/data/c2e993b88/2f8e8836d184407c99b2d0183062c3dd [2019-10-22 09:02:35,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:35,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:35,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:35,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:35,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:35,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f19c8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:35, skipping insertion in model container [2019-10-22 09:02:35,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:35" (1/1) ... [2019-10-22 09:02:35,627 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:35,660 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:36,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:36,032 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:36,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:36,123 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:36,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36 WrapperNode [2019-10-22 09:02:36,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:36,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:36,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:36,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:36,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:36,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:36,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:36,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:36,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... [2019-10-22 09:02:36,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:36,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:36,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:36,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:36,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/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 09:02:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:36,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:36,562 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:36,562 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 09:02:36,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:36 BoogieIcfgContainer [2019-10-22 09:02:36,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:36,564 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:36,564 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:36,569 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:36,570 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:36,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:35" (1/3) ... [2019-10-22 09:02:36,571 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a22bbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:36, skipping insertion in model container [2019-10-22 09:02:36,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:36,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:36" (2/3) ... [2019-10-22 09:02:36,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a22bbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:36, skipping insertion in model container [2019-10-22 09:02:36,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:36,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:36" (3/3) ... [2019-10-22 09:02:36,574 INFO L371 chiAutomizerObserver]: Analyzing ICFG stroeder2-alloca-1.i [2019-10-22 09:02:36,618 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:36,619 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:36,619 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:36,619 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:36,626 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:36,626 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:36,627 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:36,627 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:36,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 09:02:36,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:36,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:36,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:36,677 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:02:36,677 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:36,678 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:36,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 09:02:36,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:36,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:36,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:36,680 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:02:36,680 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:36,687 INFO L791 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 14#L529true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 18#L529-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 10#L534-3true [2019-10-22 09:02:36,688 INFO L793 eck$LassoCheckResult]: Loop: 10#L534-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 8#L534-2true main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 10#L534-3true [2019-10-22 09:02:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 09:02:36,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919298883] [2019-10-22 09:02:36,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,821 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:36,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 09:02:36,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466607659] [2019-10-22 09:02:36,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,837 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:36,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,839 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 09:02:36,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091570499] [2019-10-22 09:02:36,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:36,882 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:37,104 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:37,110 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:37,110 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:37,110 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:37,110 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:37,110 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:37,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:37,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:37,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration1_Lasso [2019-10-22 09:02:37,111 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:37,111 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:37,140 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 09:02:37,146 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 09:02:37,254 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 09:02:37,256 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 09:02:37,259 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 09:02:37,263 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 09:02:37,266 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 09:02:37,269 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 09:02:37,271 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 09:02:37,273 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 09:02:37,519 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:37,525 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:37,527 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 09:02:37,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,529 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:37,529 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,532 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:37,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:37,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,539 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 09:02:37,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,540 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:37,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:37,541 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:37,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,543 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 09:02:37,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,544 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:37,544 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,544 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,544 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,545 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:37,545 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:37,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,550 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 09:02:37,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,553 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:37,553 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:37,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,561 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 09:02:37,562 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,565 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:37,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,569 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:37,569 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:37,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,615 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 09:02:37,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,620 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,622 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:37,623 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:37,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:37,648 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 09:02:37,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:37,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:37,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:37,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:37,654 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:37,660 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:37,741 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:37,796 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:02:37,799 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:02:37,806 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:37,808 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:37,808 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:37,809 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2019-10-22 09:02:37,818 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:02:37,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:37,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:37,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:37,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:37,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:37,877 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 09:02:37,892 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 09:02:37,893 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-10-22 09:02:37,936 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2019-10-22 09:02:37,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-10-22 09:02:37,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 09:02:37,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:37,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 09:02:37,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:37,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 09:02:37,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:37,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-10-22 09:02:37,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:37,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2019-10-22 09:02:37,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:02:37,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:02:37,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-10-22 09:02:37,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:37,952 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:02:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-10-22 09:02:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-22 09:02:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:02:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-10-22 09:02:37,977 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:02:37,977 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:02:37,977 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:37,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-10-22 09:02:37,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:37,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:37,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:37,978 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:02:37,978 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:37,979 INFO L791 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 114#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 122#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 115#L534-3 assume !(main_~i~1 < main_~array_size~0); 116#L534-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~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, 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; 118#L517-3 [2019-10-22 09:02:37,979 INFO L793 eck$LassoCheckResult]: Loop: 118#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; 120#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 121#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 117#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 118#L517-3 [2019-10-22 09:02:37,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:37,979 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-10-22 09:02:37,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:37,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241804484] [2019-10-22 09:02:37,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:37,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:38,044 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 09:02:38,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241804484] [2019-10-22 09:02:38,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:38,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:38,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721771347] [2019-10-22 09:02:38,048 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:38,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2019-10-22 09:02:38,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:38,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598244720] [2019-10-22 09:02:38,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:38,061 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:38,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:38,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:38,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:38,109 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 09:02:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:38,140 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-10-22 09:02:38,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:38,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-10-22 09:02:38,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:38,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2019-10-22 09:02:38,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:02:38,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:02:38,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-10-22 09:02:38,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:38,144 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 09:02:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-10-22 09:02:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-10-22 09:02:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:02:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-10-22 09:02:38,146 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 09:02:38,146 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 09:02:38,146 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:38,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-10-22 09:02:38,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:38,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:38,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:38,148 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:38,148 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:38,149 INFO L791 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 144#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 154#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 148#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 145#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 146#L534-3 assume !(main_~i~1 < main_~array_size~0); 149#L534-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~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, 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; 151#L517-3 [2019-10-22 09:02:38,149 INFO L793 eck$LassoCheckResult]: Loop: 151#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; 152#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 153#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 150#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 151#L517-3 [2019-10-22 09:02:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-10-22 09:02:38,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:38,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431310761] [2019-10-22 09:02:38,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:38,186 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2019-10-22 09:02:38,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:38,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683268137] [2019-10-22 09:02:38,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:38,198 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:38,199 INFO L82 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2019-10-22 09:02:38,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:38,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298020842] [2019-10-22 09:02:38,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:38,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:38,251 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:38,478 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-10-22 09:02:38,556 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:38,556 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:38,556 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:38,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:38,556 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:38,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:38,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:38,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:38,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration3_Lasso [2019-10-22 09:02:38,557 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:38,557 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:38,563 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 09:02:38,571 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 09:02:38,574 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 09:02:38,577 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 09:02:38,579 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 09:02:38,581 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 09:02:38,588 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 09:02:38,590 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 09:02:38,592 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 09:02:38,594 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 09:02:38,597 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 09:02:38,599 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 09:02:38,601 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 09:02:38,604 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 09:02:38,607 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 09:02:38,610 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 09:02:38,614 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 09:02:38,616 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 09:02:38,994 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:38,994 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:38,994 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 09:02:38,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:38,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:38,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:38,996 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:38,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:38,996 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:38,996 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:38,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:38,997 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 09:02:38,998 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:38,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:38,998 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:38,998 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:38,999 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,000 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,002 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 09:02:39,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,004 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,004 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,007 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 09:02:39,008 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,008 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,009 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,009 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,010 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 09:02:39,010 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,010 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,011 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,011 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,011 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,012 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 09:02:39,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,013 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,014 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,014 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,016 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 09:02:39,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,017 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,018 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,018 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,019 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 09:02:39,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,022 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 09:02:39,022 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,022 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,023 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,023 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,023 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,023 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,023 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,024 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 09:02:39,025 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,025 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,026 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,027 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,028 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 09:02:39,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,030 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,031 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 09:02:39,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,034 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,035 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,035 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,040 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 09:02:39,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,042 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,042 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,043 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 09:02:39,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,043 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,044 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,044 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,044 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,044 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,045 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 09:02:39,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,047 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,047 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,049 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 09:02:39,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,051 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,051 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,074 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 09:02:39,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,076 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 09:02:39,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:39,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:39,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:39,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,078 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 09:02:39,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,078 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:39,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,080 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:39,080 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:39,089 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 09:02:39,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:39,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:39,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:39,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:39,093 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:39,093 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:39,127 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:39,142 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:39,142 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:39,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:39,143 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:39,144 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:39,144 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 09:02:39,147 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 09:02:39,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:39,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:39,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:39,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:39,187 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 09:02:39,187 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 09:02:39,187 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 09:02:39,196 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 22 transitions. Complement of second has 4 states. [2019-10-22 09:02:39,196 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 09:02:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-10-22 09:02:39,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2019-10-22 09:02:39,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:39,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2019-10-22 09:02:39,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:39,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2019-10-22 09:02:39,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:39,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-10-22 09:02:39,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:39,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 21 transitions. [2019-10-22 09:02:39,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:02:39,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:02:39,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-10-22 09:02:39,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:39,200 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 09:02:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-10-22 09:02:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-22 09:02:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:02:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-10-22 09:02:39,201 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:39,201 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:39,201 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:39,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-10-22 09:02:39,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:39,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:39,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:39,202 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:39,203 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:39,203 INFO L791 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 232#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 233#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 246#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 239#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 234#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 235#L534-3 assume !(main_~i~1 < main_~array_size~0); 240#L534-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~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, 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; 241#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; 243#L520-3 [2019-10-22 09:02:39,203 INFO L793 eck$LassoCheckResult]: Loop: 243#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 244#L520-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 243#L520-3 [2019-10-22 09:02:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2019-10-22 09:02:39,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:39,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760006301] [2019-10-22 09:02:39,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:39,231 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:39,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2019-10-22 09:02:39,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:39,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140868918] [2019-10-22 09:02:39,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:39,241 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:39,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2019-10-22 09:02:39,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:39,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424672659] [2019-10-22 09:02:39,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:39,268 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:39,462 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-10-22 09:02:39,523 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:39,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:39,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:39,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:39,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:39,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:39,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:39,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:39,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration4_Lasso [2019-10-22 09:02:39,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:39,524 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:39,527 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 09:02:39,530 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 09:02:39,532 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 09:02:39,534 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 09:02:39,536 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 09:02:39,538 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 09:02:39,540 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 09:02:39,543 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 09:02:39,545 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 09:02:39,546 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 09:02:39,549 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 09:02:39,551 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 09:02:39,559 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 09:02:39,561 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 09:02:39,563 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 09:02:39,565 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 09:02:39,568 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 09:02:39,570 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 09:02:39,697 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-22 09:02:40,069 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:40,069 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:40,070 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 09:02:40,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,072 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 09:02:40,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,074 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:40,074 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,077 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 09:02:40,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,077 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,078 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,078 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,079 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 09:02:40,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,081 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 09:02:40,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,081 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,082 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,084 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 09:02:40,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,084 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,085 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,085 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,086 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 09:02:40,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,087 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:40,088 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,090 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 09:02:40,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,091 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,091 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,092 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 09:02:40,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,093 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,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 09:02:40,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,096 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:40,096 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,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 09:02:40,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,101 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 09:02:40,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,103 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:40,103 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,108 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 09:02:40,108 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,109 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,109 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,110 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:40,110 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,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 09:02:40,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,112 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,113 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,113 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,114 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 09:02:40,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,114 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,115 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,116 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 09:02:40,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,117 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:40,117 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,120 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 09:02:40,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,121 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,121 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,121 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,122 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 09:02:40,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,124 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:40,124 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,129 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 09:02:40,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,129 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:40,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,131 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:40,132 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:40,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:40,143 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 09:02:40,144 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:40,144 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:40,144 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:40,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:40,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:40,145 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:40,145 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:40,146 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:40,151 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:40,151 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:40,152 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:40,152 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:40,152 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:40,152 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_2 Supporting invariants [] [2019-10-22 09:02:40,167 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 09:02:40,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:02:40,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:40,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:40,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:40,208 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 09:02:40,208 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 09:02:40,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 09:02:40,222 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 34 transitions. Complement of second has 7 states. [2019-10-22 09:02:40,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-10-22 09:02:40,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 09:02:40,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:40,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 09:02:40,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:40,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 09:02:40,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:40,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-10-22 09:02:40,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:40,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 26 transitions. [2019-10-22 09:02:40,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:02:40,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:02:40,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-10-22 09:02:40,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:40,225 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 09:02:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-10-22 09:02:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-10-22 09:02:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 09:02:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-10-22 09:02:40,227 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-10-22 09:02:40,228 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-10-22 09:02:40,228 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:02:40,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-10-22 09:02:40,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:40,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:40,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:40,229 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:40,229 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:40,229 INFO L791 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 351#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 365#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 357#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 352#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 353#L534-3 assume !(main_~i~1 < main_~array_size~0); 358#L534-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~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, 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; 359#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; 360#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 367#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 354#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 355#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; 362#L520-3 [2019-10-22 09:02:40,229 INFO L793 eck$LassoCheckResult]: Loop: 362#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 363#L520-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 362#L520-3 [2019-10-22 09:02:40,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2019-10-22 09:02:40,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876274009] [2019-10-22 09:02:40,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:40,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876274009] [2019-10-22 09:02:40,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152889510] [2019-10-22 09:02:40,329 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eca3ac66-dc27-4a3f-b826-25c8615a518a/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:40,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:02:40,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:40,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:02:40,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:40,433 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:40,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-10-22 09:02:40,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639315377] [2019-10-22 09:02:40,433 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2019-10-22 09:02:40,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064232529] [2019-10-22 09:02:40,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,439 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:40,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:40,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:02:40,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:02:40,472 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 14 states. [2019-10-22 09:02:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:40,662 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-10-22 09:02:40,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:02:40,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-10-22 09:02:40,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:40,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 21 states and 25 transitions. [2019-10-22 09:02:40,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:02:40,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:02:40,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2019-10-22 09:02:40,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:40,664 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-22 09:02:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2019-10-22 09:02:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-10-22 09:02:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 09:02:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-22 09:02:40,666 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-22 09:02:40,666 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-22 09:02:40,666 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:02:40,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2019-10-22 09:02:40,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:40,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:40,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:40,667 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:40,667 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:40,667 INFO L791 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 463#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~1, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 464#L529 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 479#L529-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~1 := 0; 470#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 465#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 466#L534-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet10; 471#L534-2 main_#t~post9 := main_~i~1;main_~i~1 := 1 + main_#t~post9;havoc main_#t~post9; 482#L534-3 assume !(main_~i~1 < main_~array_size~0); 476#L534-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~post4, sumOfThirdBytes_#t~mem5, sumOfThirdBytes_#t~post6, 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; 472#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; 473#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 481#L520-1 assume !(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3; 468#L517-2 sumOfThirdBytes_#t~post2 := sumOfThirdBytes_~i~0;sumOfThirdBytes_~i~0 := 1 + sumOfThirdBytes_#t~post2;havoc sumOfThirdBytes_#t~post2; 469#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; 475#L520-3 [2019-10-22 09:02:40,667 INFO L793 eck$LassoCheckResult]: Loop: 475#L520-3 call sumOfThirdBytes_#t~mem3 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); 477#L520-1 assume !!(sumOfThirdBytes_#t~mem3 > 0);havoc sumOfThirdBytes_#t~mem3;sumOfThirdBytes_#t~post4 := sumOfThirdBytes_~sum~0;sumOfThirdBytes_~sum~0 := 1 + sumOfThirdBytes_#t~post4;havoc sumOfThirdBytes_#t~post4;call sumOfThirdBytes_#t~mem5 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);sumOfThirdBytes_#t~post6 := sumOfThirdBytes_#t~mem5;call write~int(sumOfThirdBytes_#t~post6 - 1, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1);havoc sumOfThirdBytes_#t~post6;havoc sumOfThirdBytes_#t~mem5; 475#L520-3 [2019-10-22 09:02:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2019-10-22 09:02:40,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774960042] [2019-10-22 09:02:40,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,699 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2019-10-22 09:02:40,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022215654] [2019-10-22 09:02:40,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,706 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:40,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:40,707 INFO L82 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2019-10-22 09:02:40,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:40,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347091320] [2019-10-22 09:02:40,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:40,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:40,730 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:41,015 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2019-10-22 09:02:41,090 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:41,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:41,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:41,090 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:41,091 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:41,091 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:41,091 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:41,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:41,091 INFO L131 ssoRankerPreferences]: Filename of dumped script: stroeder2-alloca-1.i_Iteration6_Lasso [2019-10-22 09:02:41,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:41,091 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:41,094 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 09:02:41,238 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-22 09:02:41,262 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 09:02:41,264 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 09:02:41,266 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 09:02:41,268 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 09:02:41,269 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 09:02:41,271 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 09:02:41,273 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 09:02:41,275 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 09:02:41,276 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 09:02:41,277 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 09:02:41,278 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 09:02:41,280 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 09:02:41,281 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 09:02:41,282 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 09:02:41,284 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 09:02:41,285 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 09:02:41,286 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 09:02:41,593 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:41,593 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:41,593 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 09:02:41,594 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,595 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:41,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,597 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:41,597 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:41,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:41,604 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 09:02:41,604 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:41,605 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:41,605 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:41,605 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:41,605 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:41,605 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:41,605 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:41,606 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:41,607 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:41,608 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:41,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:41,608 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:41,608 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:41,608 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_sumOfThirdBytes_~p~0.base) ULTIMATE.start_sumOfThirdBytes_~p~0.offset)_3 Supporting invariants [] [2019-10-22 09:02:41,631 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 09:02:41,632 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:02:41,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:41,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:41,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:41,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:41,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:41,682 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 09:02:41,682 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 09:02:41,682 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 09:02:41,704 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 31 transitions. Complement of second has 7 states. [2019-10-22 09:02:41,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-10-22 09:02:41,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 09:02:41,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:41,705 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:41,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:41,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:41,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:41,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:41,745 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 09:02:41,746 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:41,746 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 09:02:41,756 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 31 transitions. Complement of second has 7 states. [2019-10-22 09:02:41,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-10-22 09:02:41,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 09:02:41,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:41,759 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:41,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:41,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:41,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:41,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:41,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:41,796 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 09:02:41,797 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:41,797 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 09:02:41,809 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 27 states and 33 transitions. Complement of second has 6 states. [2019-10-22 09:02:41,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-10-22 09:02:41,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 09:02:41,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:41,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 17 letters. Loop has 2 letters. [2019-10-22 09:02:41,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:41,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:02:41,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:41,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2019-10-22 09:02:41,812 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:41,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-10-22 09:02:41,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:41,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:41,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:41,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:41,813 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:41,813 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:41,813 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:41,813 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:02:41,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:41,813 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:41,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:41,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:41 BoogieIcfgContainer [2019-10-22 09:02:41,819 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:41,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:41,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:41,819 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:41,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:36" (3/4) ... [2019-10-22 09:02:41,822 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:41,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:41,823 INFO L168 Benchmark]: Toolchain (without parser) took 6214.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.0 MB). Free memory was 939.1 MB in the beginning and 1.2 GB in the end (delta: -227.9 MB). Peak memory consumption was 96.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,823 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:41,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.41 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,825 INFO L168 Benchmark]: Boogie Preprocessor took 37.37 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,825 INFO L168 Benchmark]: RCFGBuilder took 359.02 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,825 INFO L168 Benchmark]: BuchiAutomizer took 5255.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -72.6 MB). Peak memory consumption was 113.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:41,826 INFO L168 Benchmark]: Witness Printer took 2.87 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:41,829 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 514.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.41 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.37 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 359.02 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5255.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -72.6 MB). Peak memory consumption was 113.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.87 ms. Allocated memory is still 1.4 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 #memory_int - 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + array_size and consists of 5 locations. One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[p][p] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 90 SDtfs, 121 SDslu, 100 SDs, 0 SdLazy, 142 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital141 mio100 ax113 hnf99 lsp81 ukn78 mio100 lsp58 div100 bol100 ite100 ukn100 eq183 hnf90 smp96 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 53ms 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: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...