./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.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/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/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 cf112a0fbbdfc44a3bb289156f3ed9f3cdfb386d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:44:32,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:44:32,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:44:32,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:44:32,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:44:32,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:44:32,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:44:32,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:44:32,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:44:32,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:44:32,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:44:32,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:44:32,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:44:32,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:44:32,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:44:32,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:44:32,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:44:32,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:44:32,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:44:32,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:44:32,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:44:32,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:44:32,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:44:32,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:44:32,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:44:32,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:44:32,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:44:32,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:44:32,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:44:32,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:44:32,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:44:32,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:44:32,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:44:32,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:44:32,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:44:32,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:44:32,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:44:32,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:44:32,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:44:32,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:44:32,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:44:32,386 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:44:32,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:44:32,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:44:32,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:44:32,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:44:32,404 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:44:32,405 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:44:32,405 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:44:32,405 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:44:32,405 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:44:32,406 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:44:32,406 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:44:32,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:44:32,407 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:44:32,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:44:32,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:44:32,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:44:32,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:44:32,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:44:32,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:44:32,408 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:44:32,409 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:44:32,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:44:32,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:44:32,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:44:32,410 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:44:32,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:44:32,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:44:32,411 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:44:32,411 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:44:32,412 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/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/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 -> cf112a0fbbdfc44a3bb289156f3ed9f3cdfb386d [2019-11-16 00:44:32,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:44:32,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:44:32,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:44:32,452 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:44:32,452 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:44:32,453 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i [2019-11-16 00:44:32,505 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/bin/uautomizer/data/145b1e33c/b3d2bc67b8034cc681d79889a99f138c/FLAGaab3041cf [2019-11-16 00:44:32,928 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:44:32,929 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i [2019-11-16 00:44:32,940 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/bin/uautomizer/data/145b1e33c/b3d2bc67b8034cc681d79889a99f138c/FLAGaab3041cf [2019-11-16 00:44:33,324 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/bin/uautomizer/data/145b1e33c/b3d2bc67b8034cc681d79889a99f138c [2019-11-16 00:44:33,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:44:33,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:44:33,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:33,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:44:33,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:44:33,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:33" (1/1) ... [2019-11-16 00:44:33,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433af1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33, skipping insertion in model container [2019-11-16 00:44:33,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:44:33" (1/1) ... [2019-11-16 00:44:33,341 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:44:33,373 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:44:33,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:33,775 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:44:33,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:44:33,866 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:44:33,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33 WrapperNode [2019-11-16 00:44:33,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:44:33,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:33,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:44:33,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:44:33,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33" (1/1) ... [2019-11-16 00:44:33,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33" (1/1) ... [2019-11-16 00:44:33,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:44:33,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:44:33,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:44:33,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:44:33,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33" (1/1) ... [2019-11-16 00:44:33,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33" (1/1) ... [2019-11-16 00:44:33,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33" (1/1) ... [2019-11-16 00:44:33,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33" (1/1) ... [2019-11-16 00:44:33,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33" (1/1) ... [2019-11-16 00:44:33,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33" (1/1) ... [2019-11-16 00:44:33,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33" (1/1) ... [2019-11-16 00:44:33,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:44:33,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:44:33,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:44:33,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:44:33,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6088302a-c064-44a9-a0da-5056e63cfd33/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-11-16 00:44:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:44:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:44:33,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:44:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:44:33,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:44:33,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:44:34,246 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:44:34,246 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:44:34,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:34 BoogieIcfgContainer [2019-11-16 00:44:34,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:44:34,248 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:44:34,248 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:44:34,251 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:44:34,252 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:44:34,253 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:44:33" (1/3) ... [2019-11-16 00:44:34,257 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c0eeaf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:44:34, skipping insertion in model container [2019-11-16 00:44:34,258 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:44:34,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:44:33" (2/3) ... [2019-11-16 00:44:34,258 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c0eeaf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:44:34, skipping insertion in model container [2019-11-16 00:44:34,258 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:44:34,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:34" (3/3) ... [2019-11-16 00:44:34,260 INFO L371 chiAutomizerObserver]: Analyzing ICFG subseq-alloca-1.i [2019-11-16 00:44:34,300 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:44:34,300 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:44:34,300 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:44:34,300 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:44:34,300 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:44:34,301 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:44:34,301 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:44:34,301 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:44:34,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-16 00:44:34,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:44:34,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:34,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:34,352 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:44:34,352 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:44:34,352 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:44:34,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-16 00:44:34,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:44:34,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:34,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:34,358 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:44:34,358 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:44:34,367 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 11#L563true assume !(main_~length1~0 < 1); 15#L563-2true assume !(main_~length2~0 < 1); 8#L566-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 6#L551-5true [2019-11-16 00:44:34,367 INFO L793 eck$LassoCheckResult]: Loop: 6#L551-5true call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 16#L551-1true assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 3#L551-3true assume !!subseq_#t~short4;havoc subseq_#t~mem3;havoc subseq_#t~short4;havoc subseq_#t~mem2;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 12#L552true assume subseq_#t~mem5 == subseq_#t~mem6;havoc subseq_#t~mem5;havoc subseq_#t~mem6;subseq_#t~post7.base, subseq_#t~post7.offset := subseq_~ps~0.base, subseq_~ps~0.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_#t~post7.base, 1 + subseq_#t~post7.offset;havoc subseq_#t~post7.base, subseq_#t~post7.offset; 17#L552-2true subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 6#L551-5true [2019-11-16 00:44:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-16 00:44:34,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:34,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443380961] [2019-11-16 00:44:34,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:34,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:34,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:34,566 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:34,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:34,567 INFO L82 PathProgramCache]: Analyzing trace with hash 47815647, now seen corresponding path program 1 times [2019-11-16 00:44:34,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:34,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584366373] [2019-11-16 00:44:34,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:34,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:34,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:34,590 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:34,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:34,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1594114490, now seen corresponding path program 1 times [2019-11-16 00:44:34,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:34,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771618643] [2019-11-16 00:44:34,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:34,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:34,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:34,678 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:34,862 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-11-16 00:44:35,359 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-11-16 00:44:35,539 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-16 00:44:35,551 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:35,553 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:35,553 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:35,553 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:35,553 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:35,554 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:35,554 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:35,554 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:35,554 INFO L131 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-1.i_Iteration1_Lasso [2019-11-16 00:44:35,554 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:35,554 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:35,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:35,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:35,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:35,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,040 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-16 00:44:36,244 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-16 00:44:36,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:36,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:37,192 WARN L191 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:44:37,433 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:37,438 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:37,440 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-11-16 00:44:37,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:37,442 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:37,443 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:37,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:37,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:37,445 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:37,446 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:37,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:37,449 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-11-16 00:44:37,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:37,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:37,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:37,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:37,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:37,451 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:37,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:37,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:37,453 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-11-16 00:44:37,454 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:37,454 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:37,454 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:37,454 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:37,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:37,455 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:37,455 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:37,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:37,456 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-11-16 00:44:37,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:37,458 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:44:37,458 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:37,458 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:37,472 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:44:37,472 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:37,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:37,544 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-11-16 00:44:37,545 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:37,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:37,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:37,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:37,555 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:37,556 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:37,706 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:37,833 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:44:37,834 INFO L444 ModelExtractionUtils]: 40 out of 49 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-16 00:44:37,836 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:37,840 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:44:37,840 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:37,841 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_subseq_~ps~0.offset, v_rep(select #length ULTIMATE.start_subseq_~ps~0.base)_1) = -1*ULTIMATE.start_subseq_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_subseq_~ps~0.base)_1 Supporting invariants [] [2019-11-16 00:44:37,908 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-16 00:44:37,915 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:44:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:37,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:44:37,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:37,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:44:37,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:38,067 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:44:38,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2019-11-16 00:44:38,149 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 38 states and 51 transitions. Complement of second has 7 states. [2019-11-16 00:44:38,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:44:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-11-16 00:44:38,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-16 00:44:38,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:38,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-16 00:44:38,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:38,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-16 00:44:38,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:38,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 51 transitions. [2019-11-16 00:44:38,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:44:38,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 20 states and 28 transitions. [2019-11-16 00:44:38,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:44:38,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:44:38,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-11-16 00:44:38,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:38,168 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-16 00:44:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-11-16 00:44:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-16 00:44:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:44:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-16 00:44:38,194 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-16 00:44:38,194 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-16 00:44:38,194 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:44:38,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-16 00:44:38,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:44:38,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:38,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:38,196 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:44:38,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:44:38,196 INFO L791 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 176#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 177#L563 assume !(main_~length1~0 < 1); 182#L563-2 assume !(main_~length2~0 < 1); 191#L566-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);subseq_#in~s.base, subseq_#in~s.offset, subseq_#in~t.base, subseq_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc subseq_#res;havoc subseq_#t~mem5, subseq_#t~mem6, subseq_#t~post7.base, subseq_#t~post7.offset, subseq_#t~post8.base, subseq_#t~post8.offset, subseq_#t~mem2, subseq_#t~mem3, subseq_#t~short4, subseq_#t~mem9, subseq_~s.base, subseq_~s.offset, subseq_~t.base, subseq_~t.offset, subseq_~ps~0.base, subseq_~ps~0.offset, subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~s.base, subseq_~s.offset := subseq_#in~s.base, subseq_#in~s.offset;subseq_~t.base, subseq_~t.offset := subseq_#in~t.base, subseq_#in~t.offset;subseq_~ps~0.base, subseq_~ps~0.offset := subseq_~s.base, subseq_~s.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_~t.base, subseq_~t.offset; 192#L551-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 188#L551-1 [2019-11-16 00:44:38,196 INFO L793 eck$LassoCheckResult]: Loop: 188#L551-1 assume subseq_#t~short4;call subseq_#t~mem3 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem3; 178#L551-3 assume !!subseq_#t~short4;havoc subseq_#t~mem3;havoc subseq_#t~short4;havoc subseq_#t~mem2;call subseq_#t~mem5 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);call subseq_#t~mem6 := read~int(subseq_~pt~0.base, subseq_~pt~0.offset, 1); 179#L552 assume !(subseq_#t~mem5 == subseq_#t~mem6);havoc subseq_#t~mem5;havoc subseq_#t~mem6; 184#L552-2 subseq_#t~post8.base, subseq_#t~post8.offset := subseq_~pt~0.base, subseq_~pt~0.offset;subseq_~pt~0.base, subseq_~pt~0.offset := subseq_#t~post8.base, 1 + subseq_#t~post8.offset;havoc subseq_#t~post8.base, subseq_#t~post8.offset; 187#L551-5 call subseq_#t~mem2 := read~int(subseq_~ps~0.base, subseq_~ps~0.offset, 1);subseq_#t~short4 := 0 != subseq_#t~mem2; 188#L551-1 [2019-11-16 00:44:38,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:38,197 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-11-16 00:44:38,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:38,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151519723] [2019-11-16 00:44:38,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:38,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:38,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:38,244 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash 50829449, now seen corresponding path program 1 times [2019-11-16 00:44:38,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:38,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120740727] [2019-11-16 00:44:38,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:38,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:38,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:38,275 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:38,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:38,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2122056420, now seen corresponding path program 1 times [2019-11-16 00:44:38,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:38,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884059398] [2019-11-16 00:44:38,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:38,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:38,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:38,306 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:38,430 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-16 00:44:38,626 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:44:39,053 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 103 [2019-11-16 00:44:39,503 WARN L191 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-16 00:44:39,509 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:39,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:39,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:39,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:39,510 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:39,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:39,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:39,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:39,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: subseq-alloca-1.i_Iteration2_Lasso [2019-11-16 00:44:39,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:39,510 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:39,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:39,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:39,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:39,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,330 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-11-16 00:44:40,484 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-16 00:44: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-11-16 00:44: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-11-16 00:44: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-11-16 00:44:40,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:40,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:41,128 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-11-16 00:44:41,478 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:44:41,555 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:41,556 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:41,556 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-11-16 00:44:41,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:41,557 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:41,557 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:41,557 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:41,557 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:41,557 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:41,558 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:41,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:41,558 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-11-16 00:44:41,559 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:41,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:41,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:41,559 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:41,560 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:41,560 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:41,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:41,562 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-11-16 00:44:41,563 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:41,563 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:41,563 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:41,563 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:41,563 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:41,563 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:41,564 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:41,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:41,564 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-11-16 00:44:41,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:41,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:41,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:41,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:41,566 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:41,567 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:41,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:41,572 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-11-16 00:44:41,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:41,573 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:41,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:41,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:41,576 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:41,576 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:41,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:41,585 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-11-16 00:44:41,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:41,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:41,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:41,586 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:41,587 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:41,587 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:41,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:41,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:41,593 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:41,593 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:41,594 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:41,594 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:41,595 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:41,595 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:41,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:41,596 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-11-16 00:44:41,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:41,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:41,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:41,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:41,598 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:41,598 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:41,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:41,600 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-11-16 00:44:41,601 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:41,601 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-11-16 00:44:41,601 INFO L203 nArgumentSynthesizer]: 8 loop disjuncts [2019-11-16 00:44:41,601 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:41,651 INFO L400 nArgumentSynthesizer]: We have 192 Motzkin's Theorem applications. [2019-11-16 00:44:41,651 INFO L401 nArgumentSynthesizer]: A total of 16 supporting invariants were added. [2019-11-16 00:44:42,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:42,214 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-11-16 00:44:42,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:42,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:42,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:42,216 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:42,216 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:42,217 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:42,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:42,219 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-11-16 00:44:42,219 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:42,219 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:44:42,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:42,220 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:42,222 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:44:42,223 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:42,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:42,253 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-11-16 00:44:42,254 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:42,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:42,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:42,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:42,256 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:44:42,256 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:44:42,274 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:42,293 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:44:42,293 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:44:42,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:42,295 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:44:42,298 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:42,298 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_subseq_~pt~0.offset, v_rep(select #length ULTIMATE.start_subseq_~pt~0.base)_2) = -1*ULTIMATE.start_subseq_~pt~0.offset + 1*v_rep(select #length ULTIMATE.start_subseq_~pt~0.base)_2 Supporting invariants [] [2019-11-16 00:44:42,375 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-16 00:44:42,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:44:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:42,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:44:42,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:42,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:44:42,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:42,459 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:44:42,459 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-16 00:44:42,488 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 35 states and 51 transitions. Complement of second has 6 states. [2019-11-16 00:44:42,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:44:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-16 00:44:42,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 5 letters. [2019-11-16 00:44:42,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:42,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-16 00:44:42,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:42,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 10 letters. [2019-11-16 00:44:42,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:42,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2019-11-16 00:44:42,496 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:44:42,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2019-11-16 00:44:42,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:44:42,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:44:42,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:44:42,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:44:42,496 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:42,497 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:42,497 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:42,497 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:44:42,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:44:42,497 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:44:42,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:44:42,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:44:42 BoogieIcfgContainer [2019-11-16 00:44:42,504 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:44:42,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:44:42,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:44:42,505 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:44:42,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:44:34" (3/4) ... [2019-11-16 00:44:42,509 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:44:42,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:44:42,511 INFO L168 Benchmark]: Toolchain (without parser) took 9183.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.0 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -279.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:42,512 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:42,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:42,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:42,514 INFO L168 Benchmark]: Boogie Preprocessor took 26.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:42,515 INFO L168 Benchmark]: RCFGBuilder took 312.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:42,515 INFO L168 Benchmark]: BuchiAutomizer took 8256.10 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -154.3 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:42,520 INFO L168 Benchmark]: Witness Printer took 4.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:42,525 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 538.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 312.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8256.10 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -154.3 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * ps + unknown-#length-unknown[ps] and consists of 5 locations. One deterministic module has affine ranking function -1 * pt + unknown-#length-unknown[pt] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 7.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 36 SDslu, 15 SDs, 0 SdLazy, 19 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital354 mio100 ax106 hnf99 lsp72 ukn102 mio100 lsp30 div100 bol100 ite100 ukn100 eq202 hnf88 smp100 dnf325 smp78 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 613ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 3 DisjunctsLoop: 8 SupportingInvariants: 16 MotzkinApplications: 192 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...