./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_reverse_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/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 64bit --witnessprinter.graph.data.programhash b0714679a57fe7287c2b60684006200e7d793859 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:30,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:30,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:30,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:30,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:30,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:30,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:30,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:30,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:30,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:30,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:31,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:31,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:31,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:31,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:31,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:31,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:31,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:31,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:31,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:31,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:31,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:31,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:31,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:31,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:31,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:31,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:31,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:31,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:31,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:31,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:31,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:31,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:31,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:31,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:31,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:31,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:31,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:31,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:31,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:31,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:31,020 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:57:31,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:31,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:31,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:31,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:31,034 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:31,034 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:31,034 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:31,034 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:31,034 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:31,034 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:31,035 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:31,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:31,035 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:31,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:31,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:31,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:31,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:31,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:31,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:31,036 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:31,036 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:31,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:31,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:31,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:31,037 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:31,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:31,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:31,038 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:31,039 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:31,039 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_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0714679a57fe7287c2b60684006200e7d793859 [2019-10-22 08:57:31,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:31,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:31,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:31,082 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:31,082 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:31,083 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_reverse_alloca.i [2019-10-22 08:57:31,136 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/bin/uautomizer/data/70b19fd53/de595fe425ad4b04876544bb67ce3153/FLAG9446804b2 [2019-10-22 08:57:31,577 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:31,577 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/sv-benchmarks/c/termination-15/cstrspn_reverse_alloca.i [2019-10-22 08:57:31,586 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/bin/uautomizer/data/70b19fd53/de595fe425ad4b04876544bb67ce3153/FLAG9446804b2 [2019-10-22 08:57:31,935 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/bin/uautomizer/data/70b19fd53/de595fe425ad4b04876544bb67ce3153 [2019-10-22 08:57:31,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:31,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:31,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:31,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:31,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:31,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:31" (1/1) ... [2019-10-22 08:57:31,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a31e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:31, skipping insertion in model container [2019-10-22 08:57:31,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:31" (1/1) ... [2019-10-22 08:57:31,952 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:31,977 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:32,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:32,377 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:32,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:32,477 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:32,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32 WrapperNode [2019-10-22 08:57:32,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:32,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:32,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:32,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:32,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32" (1/1) ... [2019-10-22 08:57:32,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32" (1/1) ... [2019-10-22 08:57:32,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:32,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:32,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:32,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:32,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32" (1/1) ... [2019-10-22 08:57:32,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32" (1/1) ... [2019-10-22 08:57:32,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32" (1/1) ... [2019-10-22 08:57:32,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32" (1/1) ... [2019-10-22 08:57:32,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32" (1/1) ... [2019-10-22 08:57:32,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32" (1/1) ... [2019-10-22 08:57:32,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32" (1/1) ... [2019-10-22 08:57:32,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:32,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:32,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:32,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:32,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63c4a3ae-f662-4b66-b0ad-7a8c29ca46ed/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:32,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:33,094 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:33,095 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:57:33,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:33 BoogieIcfgContainer [2019-10-22 08:57:33,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:33,097 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:33,097 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:33,100 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:33,101 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:33,101 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:31" (1/3) ... [2019-10-22 08:57:33,102 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b884fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:33, skipping insertion in model container [2019-10-22 08:57:33,102 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:33,103 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:32" (2/3) ... [2019-10-22 08:57:33,103 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b884fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:33, skipping insertion in model container [2019-10-22 08:57:33,103 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:33,103 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:33" (3/3) ... [2019-10-22 08:57:33,105 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn_reverse_alloca.i [2019-10-22 08:57:33,141 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:33,141 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:33,141 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:33,141 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:33,142 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:33,142 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:33,142 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:33,142 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:33,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:57:33,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:57:33,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:33,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:33,179 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:33,179 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:57:33,179 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:33,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:57:33,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:57:33,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:33,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:33,181 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:33,182 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:57:33,189 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 6#L369-4true [2019-10-22 08:57:33,189 INFO L793 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2019-10-22 08:57:33,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:33,195 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:57:33,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:33,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765215441] [2019-10-22 08:57:33,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:33,347 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:33,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-10-22 08:57:33,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:33,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562063787] [2019-10-22 08:57:33,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:33,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562063787] [2019-10-22 08:57:33,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:33,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:33,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527770079] [2019-10-22 08:57:33,387 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:33,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:33,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:57:33,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:57:33,401 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-22 08:57:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:33,408 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-10-22 08:57:33,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:57:33,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-10-22 08:57:33,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:57:33,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-10-22 08:57:33,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:57:33,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:57:33,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-10-22 08:57:33,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:33,421 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:57:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-10-22 08:57:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:57:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:57:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-10-22 08:57:33,447 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:57:33,447 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:57:33,447 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:33,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-10-22 08:57:33,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:57:33,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:33,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:33,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:33,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:33,449 INFO L791 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 47#L369-4 [2019-10-22 08:57:33,449 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2019-10-22 08:57:33,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:33,450 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-10-22 08:57:33,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:33,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971884564] [2019-10-22 08:57:33,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:33,485 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:33,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-10-22 08:57:33,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:33,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201163550] [2019-10-22 08:57:33,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:33,530 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:33,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-10-22 08:57:33,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:33,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302678490] [2019-10-22 08:57:33,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:33,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:33,618 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:33,801 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-22 08:57:34,077 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-10-22 08:57:34,379 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-10-22 08:57:34,496 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-22 08:57:34,508 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:34,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:34,509 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:34,509 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:34,509 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:34,509 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:34,509 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:34,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:34,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca.i_Iteration2_Lasso [2019-10-22 08:57:34,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:34,511 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:34,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 08:57:34,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:34,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:34,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:34,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:34,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:34,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 08:57:34,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 08:57:34,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:34,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 08:57:34,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:34,879 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-10-22 08:57:35,047 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-10-22 08:57:35,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:35,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:35,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:35,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:35,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:35,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:35,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:35,570 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-10-22 08:57:35,884 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:57:35,905 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:35,910 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:35,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,913 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:35,913 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,913 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,913 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,915 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:35,915 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:35,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:35,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,920 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:35,920 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:35,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:35,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,924 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:35,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,925 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:35,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:35,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:35,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,927 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,927 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:35,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,928 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,928 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:35,928 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:35,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:35,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,932 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:35,932 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:35,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:35,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,936 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,936 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:35,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,937 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,937 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:35,937 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:35,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:35,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,939 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,939 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:35,939 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,940 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:35,940 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:35,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:35,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,942 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,942 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:35,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,942 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,943 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:35,943 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:35,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:35,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,945 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,945 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:35,945 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,945 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,946 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:35,946 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:35,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:35,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:35,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:35,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:35,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:35,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,951 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,952 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:35,952 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:35,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:35,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:35,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:35,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:35,956 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:35,956 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:35,963 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:35,963 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:36,035 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:36,070 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:57:36,070 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:57:36,072 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:36,074 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:36,074 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:36,075 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset) = 2*ULTIMATE.start_cstrspn_~sc1~0.offset + 1 Supporting invariants [] [2019-10-22 08:57:36,114 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 08:57:36,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:36,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:36,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:36,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:36,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:36,196 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:57:36,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:57:36,225 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-10-22 08:57:36,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-10-22 08:57:36,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 08:57:36,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:36,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-10-22 08:57:36,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:36,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-10-22 08:57:36,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:36,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-10-22 08:57:36,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:36,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-10-22 08:57:36,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:57:36,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:57:36,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-10-22 08:57:36,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:36,233 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:57:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-10-22 08:57:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:57:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:57:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 08:57:36,234 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:57:36,234 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:57:36,234 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:36,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-10-22 08:57:36,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:36,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:36,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:36,236 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:36,236 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:36,236 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 177#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 189#L372-5 [2019-10-22 08:57:36,236 INFO L793 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 184#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset - 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 189#L372-5 [2019-10-22 08:57:36,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:36,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-10-22 08:57:36,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:36,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807960142] [2019-10-22 08:57:36,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,266 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-10-22 08:57:36,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:36,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271463491] [2019-10-22 08:57:36,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,277 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:36,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:36,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-10-22 08:57:36,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:36,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696880598] [2019-10-22 08:57:36,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:36,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:36,310 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:36,797 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2019-10-22 08:57:36,900 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:36,900 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:36,900 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:36,900 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:36,900 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:36,900 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:36,900 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:36,900 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:36,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca.i_Iteration3_Lasso [2019-10-22 08:57:36,900 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:36,900 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:36,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:36,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:36,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,218 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-10-22 08:57:37,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:37,702 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-22 08:57:38,002 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:57:38,110 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:38,110 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:38,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:38,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,111 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:38,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,112 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:38,112 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:38,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:38,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,114 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:38,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,114 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,114 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:38,114 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:38,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:38,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,116 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,117 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:38,117 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:38,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:38,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,120 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,121 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:38,121 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:38,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:38,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,123 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:57:38,124 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-10-22 08:57:38,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,152 INFO L400 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-10-22 08:57:38,152 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-10-22 08:57:38,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:38,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,295 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:38,295 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:38,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:38,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,300 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:57:38,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,303 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:38,303 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:38,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:38,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,320 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:38,320 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:38,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:38,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:38,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:38,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:38,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:38,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:38,326 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:38,326 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:38,353 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:38,369 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:38,369 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:57:38,370 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:38,370 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:38,371 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:38,371 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset) = 2*ULTIMATE.start_cstrspn_~s~0.offset + 1 Supporting invariants [] [2019-10-22 08:57:38,413 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-10-22 08:57:38,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:38,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:38,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:38,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:38,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:38,456 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:57:38,456 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:57:38,474 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-10-22 08:57:38,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:57:38,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-10-22 08:57:38,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:38,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:57:38,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:38,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-10-22 08:57:38,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:38,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-10-22 08:57:38,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:38,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-10-22 08:57:38,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:57:38,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:57:38,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-10-22 08:57:38,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:38,479 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-10-22 08:57:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-10-22 08:57:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-22 08:57:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:57:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-22 08:57:38,481 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:57:38,482 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:57:38,482 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:38,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-10-22 08:57:38,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:38,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:38,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:38,483 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:38,483 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:38,483 INFO L791 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 358#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 359#L382 assume !(main_~length1~0 < 1); 360#L382-2 assume !(main_~length2~0 < 1); 357#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 353#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 354#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 367#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 363#L372-1 assume !cstrspn_#t~short210; 364#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209; 349#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 350#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 351#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 352#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 356#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 366#L372-5 [2019-10-22 08:57:38,484 INFO L793 eck$LassoCheckResult]: Loop: 366#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 361#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 362#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset - 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 366#L372-5 [2019-10-22 08:57:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-10-22 08:57:38,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070112660] [2019-10-22 08:57:38,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:38,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070112660] [2019-10-22 08:57:38,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:38,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:57:38,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720913193] [2019-10-22 08:57:38,547 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:38,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,547 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-10-22 08:57:38,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9562856] [2019-10-22 08:57:38,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,554 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:38,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:38,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:38,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:38,702 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:57:38,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:38,788 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-10-22 08:57:38,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:38,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-10-22 08:57:38,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:38,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-10-22 08:57:38,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:57:38,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:57:38,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-10-22 08:57:38,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:38,790 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-22 08:57:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-10-22 08:57:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-10-22 08:57:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:57:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-10-22 08:57:38,792 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 08:57:38,792 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 08:57:38,792 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:38,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-10-22 08:57:38,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:38,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:38,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:38,796 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:38,796 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:38,797 INFO L791 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 430#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 431#L382 assume !(main_~length1~0 < 1); 432#L382-2 assume !(main_~length2~0 < 1); 429#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 425#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 426#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 444#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 443#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 442#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209; 421#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 422#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 423#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 424#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 428#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 438#L372-5 [2019-10-22 08:57:38,797 INFO L793 eck$LassoCheckResult]: Loop: 438#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 433#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 434#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset - 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 438#L372-5 [2019-10-22 08:57:38,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,797 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-10-22 08:57:38,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530433100] [2019-10-22 08:57:38,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,834 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,838 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-10-22 08:57:38,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699703664] [2019-10-22 08:57:38,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,847 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:38,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-10-22 08:57:38,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:38,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251788123] [2019-10-22 08:57:38,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:38,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:38,884 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:39,579 WARN L191 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 144 [2019-10-22 08:57:40,452 WARN L191 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 116 [2019-10-22 08:57:40,454 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:40,454 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:40,454 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:40,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:40,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:40,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:40,455 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:40,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:40,455 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca.i_Iteration5_Lasso [2019-10-22 08:57:40,455 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:40,455 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:40,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:40,689 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-22 08:57:41,228 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2019-10-22 08:57:41,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:41,779 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-10-22 08:57:41,916 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-22 08:57:42,162 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:57:42,256 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:42,256 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:42,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,257 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,257 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,258 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,258 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,260 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,260 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,260 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,260 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,260 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,263 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,263 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,265 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,265 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,266 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,266 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,266 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,266 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,268 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,268 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,269 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,270 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,270 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,270 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,270 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,271 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,272 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,272 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,272 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,272 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,273 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,275 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,275 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,276 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,276 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,276 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,276 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,276 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,276 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,278 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,279 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,279 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,281 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,281 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,281 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,281 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,281 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,282 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,282 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,286 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,286 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,286 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,287 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,287 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,287 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,288 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,288 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,288 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,288 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,289 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,289 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,294 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,294 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,295 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,295 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,295 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,295 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,296 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,296 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,297 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,297 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:42,297 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,297 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,297 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,299 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:42,299 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:42,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,301 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:57:42,301 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-10-22 08:57:42,301 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,327 INFO L400 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-10-22 08:57:42,327 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-10-22 08:57:42,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,508 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,508 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:57:42,508 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,508 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,511 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:42,511 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,525 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,526 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,526 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,529 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,529 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,534 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,534 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,536 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,536 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:42,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:42,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:42,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:42,538 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:42,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:42,541 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:42,541 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:42,572 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:42,594 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:57:42,594 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:57:42,594 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:42,595 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:42,595 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:42,595 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3 + 2*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-10-22 08:57:42,700 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-10-22 08:57:42,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:57:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:42,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:57:42,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:42,753 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:57:42,753 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:57:42,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-10-22 08:57:42,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:57:42,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:57:42,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:42,780 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:42,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:42,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:57:42,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:42,831 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 08:57:42,831 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:57:42,850 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-10-22 08:57:42,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:57:42,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:57:42,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:42,854 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:42,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:42,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:57:42,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:42,907 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 08:57:42,907 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:57:42,932 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2019-10-22 08:57:42,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-10-22 08:57:42,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:57:42,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:42,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 08:57:42,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:42,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-10-22 08:57:42,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:42,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-10-22 08:57:42,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:42,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-10-22 08:57:42,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:42,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:42,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:42,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:42,936 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:42,936 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:42,936 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:42,936 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:57:42,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:42,937 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:42,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:42,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:42 BoogieIcfgContainer [2019-10-22 08:57:42,945 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:42,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:42,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:42,946 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:42,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:33" (3/4) ... [2019-10-22 08:57:42,949 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:42,950 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:42,952 INFO L168 Benchmark]: Toolchain (without parser) took 11013.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.3 MB). Free memory was 944.5 MB in the beginning and 950.4 MB in the end (delta: -5.9 MB). Peak memory consumption was 388.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:42,953 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:42,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:42,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.57 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:42,954 INFO L168 Benchmark]: Boogie Preprocessor took 32.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:42,956 INFO L168 Benchmark]: RCFGBuilder took 534.62 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:42,956 INFO L168 Benchmark]: BuchiAutomizer took 9848.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 950.4 MB in the end (delta: 159.9 MB). Peak memory consumption was 386.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:42,957 INFO L168 Benchmark]: Witness Printer took 5.32 ms. Allocated memory is still 1.4 GB. Free memory is still 950.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:42,959 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 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 538.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.57 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 534.62 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9848.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 950.4 MB in the end (delta: 159.9 MB). Peak memory consumption was 386.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.32 ms. Allocated memory is still 1.4 GB. Free memory is still 950.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + 2 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 114 SDtfs, 112 SDslu, 56 SDs, 0 SdLazy, 87 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital400 mio100 ax100 hnf99 lsp91 ukn77 mio100 lsp42 div114 bol100 ite100 ukn100 eq182 hnf77 smp96 dnf501 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 206ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...