./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a398041f87cd84898ae142142fdf4872d746c3b1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:34:53,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:53,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:53,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:53,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:53,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:53,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:53,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:53,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:53,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:53,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:53,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:53,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:53,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:53,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:53,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:53,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:53,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:53,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:53,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:53,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:53,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:53,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:53,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:53,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:53,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:53,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:53,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:53,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:53,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:53,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:53,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:53,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:53,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:53,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:53,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:53,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:53,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:53,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:53,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:53,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:53,437 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:34:53,453 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:53,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:53,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:53,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:53,455 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:53,455 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:53,456 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:53,456 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:53,456 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:53,456 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:53,456 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:53,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:53,457 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:53,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:53,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:53,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:53,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:53,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:53,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:53,458 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:53,459 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:53,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:53,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:53,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:53,460 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:53,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:53,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:53,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:53,460 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:53,461 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:53,462 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a398041f87cd84898ae142142fdf4872d746c3b1 [2020-07-29 01:34:53,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:53,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:53,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:53,762 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:53,763 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:53,764 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i [2020-07-29 01:34:53,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8797e0178/c3138e39e1c8403c864d7f2117fc2ece/FLAG2641b1ed5 [2020-07-29 01:34:54,350 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:54,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i [2020-07-29 01:34:54,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8797e0178/c3138e39e1c8403c864d7f2117fc2ece/FLAG2641b1ed5 [2020-07-29 01:34:54,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8797e0178/c3138e39e1c8403c864d7f2117fc2ece [2020-07-29 01:34:54,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:54,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:54,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:54,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:54,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:54,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:54" (1/1) ... [2020-07-29 01:34:54,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711c9468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:54, skipping insertion in model container [2020-07-29 01:34:54,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:54" (1/1) ... [2020-07-29 01:34:54,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:54,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:55,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:55,138 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:55,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:55,251 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:55,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55 WrapperNode [2020-07-29 01:34:55,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:55,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:55,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:55,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:55,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55" (1/1) ... [2020-07-29 01:34:55,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55" (1/1) ... [2020-07-29 01:34:55,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:55,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:55,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:55,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:55,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55" (1/1) ... [2020-07-29 01:34:55,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55" (1/1) ... [2020-07-29 01:34:55,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55" (1/1) ... [2020-07-29 01:34:55,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55" (1/1) ... [2020-07-29 01:34:55,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55" (1/1) ... [2020-07-29 01:34:55,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55" (1/1) ... [2020-07-29 01:34:55,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55" (1/1) ... [2020-07-29 01:34:55,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:55,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:55,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:55,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:55,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 01:34:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:55,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:55,837 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:55,837 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:34:55,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:55 BoogieIcfgContainer [2020-07-29 01:34:55,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:55,842 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:55,842 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:55,846 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:55,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:55,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:54" (1/3) ... [2020-07-29 01:34:55,848 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28e0910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:55, skipping insertion in model container [2020-07-29 01:34:55,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:55,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:55" (2/3) ... [2020-07-29 01:34:55,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28e0910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:55, skipping insertion in model container [2020-07-29 01:34:55,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:55,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:55" (3/3) ... [2020-07-29 01:34:55,851 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.17-alloca.i [2020-07-29 01:34:55,898 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:55,899 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:55,899 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:55,899 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:55,900 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:55,900 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:55,901 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:55,901 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:55,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:34:55,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:55,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:55,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:55,939 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:55,939 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:55,939 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:55,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:34:55,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:55,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:55,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:55,943 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:55,943 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:55,949 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 13#L557-3true [2020-07-29 01:34:55,950 INFO L796 eck$LassoCheckResult]: Loop: 13#L557-3true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 8#L557-1true assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 11#L558-3true assume !true; 14#L558-4true call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 13#L557-3true [2020-07-29 01:34:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:34:55,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:55,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064698626] [2020-07-29 01:34:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:56,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:56,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:56,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:56,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:56,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2020-07-29 01:34:56,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:56,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503519207] [2020-07-29 01:34:56,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:56,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#true} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {18#true} is VALID [2020-07-29 01:34:56,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {18#true} assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; {18#true} is VALID [2020-07-29 01:34:56,255 INFO L280 TraceCheckUtils]: 2: Hoare triple {18#true} assume !true; {19#false} is VALID [2020-07-29 01:34:56,255 INFO L280 TraceCheckUtils]: 3: Hoare triple {19#false} call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; {19#false} is VALID [2020-07-29 01:34:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:56,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503519207] [2020-07-29 01:34:56,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:56,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:34:56,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581954064] [2020-07-29 01:34:56,272 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:56,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:56,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:34:56,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:34:56,290 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-07-29 01:34:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:56,324 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:34:56,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:34:56,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:34:56,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:56,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-07-29 01:34:56,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:56,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2020-07-29 01:34:56,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:34:56,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:34:56,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-07-29 01:34:56,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:56,362 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:34:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-07-29 01:34:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:34:56,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:56,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:34:56,389 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:34:56,390 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:34:56,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:56,392 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:34:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:34:56,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:56,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:56,394 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 8 transitions. [2020-07-29 01:34:56,394 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 8 transitions. [2020-07-29 01:34:56,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:56,395 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:34:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:34:56,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:56,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:56,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:56,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:34:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-07-29 01:34:56,400 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:34:56,400 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:34:56,400 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:56,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:34:56,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:56,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:56,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:56,402 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:56,402 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:56,402 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L557-3 [2020-07-29 01:34:56,402 INFO L796 eck$LassoCheckResult]: Loop: 33#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 38#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 37#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 35#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 36#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 33#L557-3 [2020-07-29 01:34:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:56,403 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 01:34:56,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:56,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258310187] [2020-07-29 01:34:56,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:56,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:56,478 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:56,493 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:56,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:56,494 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2020-07-29 01:34:56,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:56,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286760444] [2020-07-29 01:34:56,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:56,514 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:56,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:56,539 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:56,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2020-07-29 01:34:56,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:56,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251063844] [2020-07-29 01:34:56,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:56,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:56,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:56,644 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:57,500 WARN L193 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 103 [2020-07-29 01:34:57,818 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-07-29 01:34:57,835 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:57,836 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:57,836 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:57,836 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:57,837 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:57,837 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:57,837 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:57,837 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:57,838 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.17-alloca.i_Iteration2_Lasso [2020-07-29 01:34:57,838 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:57,838 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:57,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:57,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:58,733 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2020-07-29 01:34:58,891 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2020-07-29 01:34:58,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:58,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:58,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:58,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:00,022 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:00,028 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:00,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:00,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:00,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:00,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:00,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:00,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:00,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:00,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,118 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 [2020-07-29 01:35:00,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,155 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 [2020-07-29 01:35:00,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,185 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 [2020-07-29 01:35:00,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,222 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 [2020-07-29 01:35:00,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,232 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,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 [2020-07-29 01:35:00,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:00,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:00,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:00,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,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 [2020-07-29 01:35:00,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:00,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:00,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:00,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:00,326 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 [2020-07-29 01:35:00,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:00,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:00,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,354 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 [2020-07-29 01:35:00,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:00,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:00,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:00,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,392 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 [2020-07-29 01:35:00,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,422 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 [2020-07-29 01:35:00,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:00,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:00,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:00,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,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 [2020-07-29 01:35:00,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,484 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 [2020-07-29 01:35:00,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,521 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 [2020-07-29 01:35:00,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,565 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 [2020-07-29 01:35:00,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:00,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:00,637 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 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,722 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 [2020-07-29 01:35:00,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,760 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 [2020-07-29 01:35:00,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,802 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 [2020-07-29 01:35:00,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:00,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:00,874 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 [2020-07-29 01:35:00,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:00,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:00,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:00,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:00,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:00,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:00,960 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:35:00,961 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:00,968 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:00,973 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:00,974 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:00,975 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2020-07-29 01:35:01,269 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2020-07-29 01:35:01,274 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);" "assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;" "call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);" "assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;" "call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11;" [2020-07-29 01:35:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:01,291 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:01,292 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:01,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:01,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:01,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {62#unseeded} is VALID [2020-07-29 01:35:01,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#unseeded} havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {62#unseeded} is VALID [2020-07-29 01:35:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:01,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:35:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:01,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:01,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#(>= oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {288#(and (<= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem7|))} is VALID [2020-07-29 01:35:01,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {288#(and (<= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem7|))} assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; {292#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} is VALID [2020-07-29 01:35:01,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {292#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {292#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} is VALID [2020-07-29 01:35:01,514 INFO L280 TraceCheckUtils]: 3: Hoare triple {292#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; {292#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} is VALID [2020-07-29 01:35:01,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {292#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; {280#(or (and (> oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:01,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:01,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:01,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:01,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,538 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 [2020-07-29 01:35:01,538 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-07-29 01:35:01,636 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 17 states and 20 transitions. Complement of second has 7 states. [2020-07-29 01:35:01,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:01,636 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:01,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2020-07-29 01:35:01,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:01,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:01,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:35:01,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:01,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:01,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:01,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-07-29 01:35:01,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:01,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:01,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:01,642 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2020-07-29 01:35:01,643 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:01,643 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:35:01,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:01,644 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:01,644 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 01:35:01,645 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:01,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:01,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:01,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:01,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:01,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:01,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:01,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:01,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:01,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:01,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:35:01,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:35:01,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:35:01,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:35:01,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:35:01,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:35:01,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:01,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:01,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:01,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:01,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:01,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:35:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:35:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:35:01,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:01,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:01,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:35:01,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:35:01,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:35:01,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:35:01,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:35:01,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:35:01,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:35:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:35:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:01,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:01,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:01,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:01,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:01,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:01,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:01,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:01,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:01,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:01,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:01,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:01,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:01,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:01,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:01,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,660 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:35:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2020-07-29 01:35:01,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:35:01,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:35:01,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2020-07-29 01:35:01,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:01,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 01:35:01,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:01,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2020-07-29 01:35:01,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:35:01,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:35:01,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2020-07-29 01:35:01,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:01,666 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-07-29 01:35:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2020-07-29 01:35:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 01:35:01,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:01,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 19 transitions. Second operand 16 states. [2020-07-29 01:35:01,668 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 19 transitions. Second operand 16 states. [2020-07-29 01:35:01,668 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 16 states. [2020-07-29 01:35:01,669 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:01,672 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-29 01:35:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-29 01:35:01,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:01,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:01,672 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 19 transitions. [2020-07-29 01:35:01,672 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 19 transitions. [2020-07-29 01:35:01,673 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:01,675 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-29 01:35:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-29 01:35:01,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:01,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:01,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:01,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:35:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-07-29 01:35:01,677 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-07-29 01:35:01,677 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-07-29 01:35:01,677 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:35:01,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-07-29 01:35:01,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:01,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:01,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:01,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:35:01,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:01,679 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 329#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 330#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 343#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 344#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 332#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 333#L558-3 [2020-07-29 01:35:01,679 INFO L796 eck$LassoCheckResult]: Loop: 333#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 339#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 333#L558-3 [2020-07-29 01:35:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2020-07-29 01:35:01,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:01,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969883390] [2020-07-29 01:35:01,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:01,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:01,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,758 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:01,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:01,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2020-07-29 01:35:01,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:01,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424154016] [2020-07-29 01:35:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:01,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:01,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,782 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:01,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:01,782 INFO L82 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2020-07-29 01:35:01,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:01,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127957499] [2020-07-29 01:35:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:01,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:01,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:02,728 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 122 [2020-07-29 01:35:03,066 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-07-29 01:35:03,072 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:03,072 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:03,072 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:03,072 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:03,073 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:03,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:03,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:03,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:03,073 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.17-alloca.i_Iteration3_Lasso [2020-07-29 01:35:03,073 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:03,073 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:03,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,749 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2020-07-29 01:35:03,900 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-07-29 01:35:03,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:03,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:04,361 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-07-29 01:35:05,015 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:05,016 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:05,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:05,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:05,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:05,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,059 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 [2020-07-29 01:35:05,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:05,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:05,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:05,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:05,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:05,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:05,144 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 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:05,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:05,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:05,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:05,168 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 [2020-07-29 01:35:05,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:05,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:05,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,196 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 [2020-07-29 01:35:05,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,232 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 [2020-07-29 01:35:05,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:05,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:05,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:05,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,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 [2020-07-29 01:35:05,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:05,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:05,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:05,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,283 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 [2020-07-29 01:35:05,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:05,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:05,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:05,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,311 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 [2020-07-29 01:35:05,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:05,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:05,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:05,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:05,338 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 Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,371 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 [2020-07-29 01:35:05,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,415 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 [2020-07-29 01:35:05,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,460 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 [2020-07-29 01:35:05,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,496 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 [2020-07-29 01:35:05,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,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 [2020-07-29 01:35:05,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,552 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 [2020-07-29 01:35:05,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,581 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 [2020-07-29 01:35:05,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,611 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 [2020-07-29 01:35:05,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:05,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:05,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:05,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:05,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:05,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:05,637 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:05,651 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:35:05,651 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,653 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:05,655 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:05,655 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:05,655 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 Supporting invariants [] [2020-07-29 01:35:05,817 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2020-07-29 01:35:05,819 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);" "assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10;" [2020-07-29 01:35:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:05,826 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:05,826 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:05,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:05,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:05,880 INFO L280 TraceCheckUtils]: 0: Hoare triple {422#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {422#unseeded} is VALID [2020-07-29 01:35:05,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#unseeded} havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {422#unseeded} is VALID [2020-07-29 01:35:05,881 INFO L280 TraceCheckUtils]: 2: Hoare triple {422#unseeded} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {422#unseeded} is VALID [2020-07-29 01:35:05,882 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#unseeded} assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; {422#unseeded} is VALID [2020-07-29 01:35:05,882 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#unseeded} call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {422#unseeded} is VALID [2020-07-29 01:35:05,883 INFO L280 TraceCheckUtils]: 5: Hoare triple {422#unseeded} assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; {422#unseeded} is VALID [2020-07-29 01:35:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:05,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:35:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:05,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:05,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {425#(>= oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))} call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {615#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem9|) (<= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))} is VALID [2020-07-29 01:35:05,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {615#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem9|) (<= |ULTIMATE.start_test_fun_#t~mem8| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))} assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; {595#(or (and (> oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:05,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:05,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:05,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:05,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:05,933 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 [2020-07-29 01:35:05,933 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:35:05,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2020-07-29 01:35:05,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:05,989 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:05,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2020-07-29 01:35:05,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:05,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:05,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:05,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:05,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:05,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:05,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-07-29 01:35:05,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:05,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:05,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:05,997 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2020-07-29 01:35:05,998 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:05,998 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:06,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:06,000 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:06,000 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2020-07-29 01:35:06,001 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:06,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:06,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:06,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:06,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:06,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:06,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:06,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:06,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:06,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:06,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:35:06,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:35:06,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:35:06,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:35:06,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:35:06,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:35:06,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:06,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:06,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:06,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:06,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:06,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:06,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:06,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:06,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:06,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:06,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:06,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:06,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:06,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:06,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:06,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:06,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:06,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:06,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:06,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:06,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:06,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:06,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:06,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:06,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:06,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:06,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:06,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:06,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:06,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:06,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:06,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:06,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:06,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 5 letters. [2020-07-29 01:35:06,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 01:35:06,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 27 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 5 letters. [2020-07-29 01:35:06,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,016 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 01:35:06,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:06,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:06,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:35:06,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:06,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. cyclomatic complexity: 8 [2020-07-29 01:35:06,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:06,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 26 transitions. [2020-07-29 01:35:06,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:35:06,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:35:06,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2020-07-29 01:35:06,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:06,021 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-07-29 01:35:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2020-07-29 01:35:06,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-29 01:35:06,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:06,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 26 transitions. Second operand 20 states. [2020-07-29 01:35:06,023 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 26 transitions. Second operand 20 states. [2020-07-29 01:35:06,023 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 20 states. [2020-07-29 01:35:06,024 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:06,026 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2020-07-29 01:35:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2020-07-29 01:35:06,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:06,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:06,026 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states and 26 transitions. [2020-07-29 01:35:06,027 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states and 26 transitions. [2020-07-29 01:35:06,027 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:06,031 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2020-07-29 01:35:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2020-07-29 01:35:06,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:06,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:06,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:06,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:35:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-07-29 01:35:06,034 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-07-29 01:35:06,034 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-07-29 01:35:06,034 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:35:06,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-07-29 01:35:06,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:06,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:06,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:06,035 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:06,036 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:06,036 INFO L794 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 651#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 652#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 666#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 670#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 669#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 668#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 654#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 655#L558-4 [2020-07-29 01:35:06,036 INFO L796 eck$LassoCheckResult]: Loop: 655#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 663#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 658#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 659#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 662#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 655#L558-4 [2020-07-29 01:35:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:06,038 INFO L82 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2020-07-29 01:35:06,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:06,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266749786] [2020-07-29 01:35:06,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:06,095 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:06,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:06,133 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:06,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:06,134 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2020-07-29 01:35:06,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:06,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693690251] [2020-07-29 01:35:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:06,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:06,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:06,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:06,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:06,155 INFO L82 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2020-07-29 01:35:06,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:06,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334549539] [2020-07-29 01:35:06,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:06,208 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:06,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:06,265 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:07,736 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 161 DAG size of output: 141 [2020-07-29 01:35:08,414 WARN L193 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-07-29 01:35:08,418 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:08,418 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:08,418 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:08,418 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:08,418 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:08,418 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:08,418 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:08,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:08,419 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.17-alloca.i_Iteration4_Lasso [2020-07-29 01:35:08,419 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:08,419 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:08,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:08,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:08,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:08,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:08,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:08,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,271 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 95 [2020-07-29 01:35:09,435 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2020-07-29 01:35:09,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:09,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:10,045 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-07-29 01:35:10,711 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:10,711 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:10,715 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 [2020-07-29 01:35:10,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:10,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:10,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:10,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:10,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:10,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:10,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:10,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:10,740 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 [2020-07-29 01:35:10,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:10,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:10,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:10,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:10,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:10,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:10,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:10,772 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 [2020-07-29 01:35:10,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:10,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:10,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:10,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:10,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:10,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:10,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:10,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:10,799 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 Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:10,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:10,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:10,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:10,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:10,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:10,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:10,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:10,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:10,840 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 [2020-07-29 01:35:10,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:10,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:10,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:10,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:10,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:10,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:10,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:10,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:10,864 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 [2020-07-29 01:35:10,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:10,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:10,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:10,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:10,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:10,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:10,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:10,894 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 [2020-07-29 01:35:10,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:10,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:10,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:10,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:10,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:10,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:10,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:10,925 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 [2020-07-29 01:35:10,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:10,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:10,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:10,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:10,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:10,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:10,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:10,954 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 [2020-07-29 01:35:10,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:10,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:10,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:10,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:10,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:10,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:10,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:10,994 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:35:10,994 INFO L444 ModelExtractionUtils]: 20 out of 40 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:10,996 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:10,998 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:10,998 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:10,998 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 Supporting invariants [] [2020-07-29 01:35:11,252 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2020-07-29 01:35:11,255 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11;" "call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);" "assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;" "call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);" "assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;" [2020-07-29 01:35:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:11,265 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:11,265 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:11,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:11,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:11,315 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {765#unseeded} is VALID [2020-07-29 01:35:11,316 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#unseeded} havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {765#unseeded} is VALID [2020-07-29 01:35:11,316 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#unseeded} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {765#unseeded} is VALID [2020-07-29 01:35:11,317 INFO L280 TraceCheckUtils]: 3: Hoare triple {765#unseeded} assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; {765#unseeded} is VALID [2020-07-29 01:35:11,318 INFO L280 TraceCheckUtils]: 4: Hoare triple {765#unseeded} call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {765#unseeded} is VALID [2020-07-29 01:35:11,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {765#unseeded} assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; {765#unseeded} is VALID [2020-07-29 01:35:11,319 INFO L280 TraceCheckUtils]: 6: Hoare triple {765#unseeded} call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {765#unseeded} is VALID [2020-07-29 01:35:11,319 INFO L280 TraceCheckUtils]: 7: Hoare triple {765#unseeded} assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; {765#unseeded} is VALID [2020-07-29 01:35:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:11,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:35:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:11,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:11,399 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:11,400 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 60 [2020-07-29 01:35:11,432 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-29 01:35:11,440 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:11,450 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:11,512 INFO L624 ElimStorePlain]: treesize reduction 36, result has 65.0 percent of original size [2020-07-29 01:35:11,513 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-07-29 01:35:11,514 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:67 [2020-07-29 01:35:14,134 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:14,135 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_159|]. (let ((.cse1 (select |v_#memory_int_159| ULTIMATE.start_test_fun_~x_ref~0.base))) (let ((.cse0 (select .cse1 ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= .cse0 (+ oldRank0 (select (select |v_#memory_int_159| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (= |#memory_int| (store |v_#memory_int_159| ULTIMATE.start_test_fun_~x_ref~0.base (store .cse1 ULTIMATE.start_test_fun_~x_ref~0.offset (+ .cse0 (- 1)))))))) [2020-07-29 01:35:14,135 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset)) (.cse2 (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))) (let ((.cse0 (or (and .cse1 .cse2) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))))) (or (and .cse0 (not .cse1)) (and .cse1 (<= 0 oldRank0) .cse2) (and (not .cse2) .cse0)))) [2020-07-29 01:35:14,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {768#(>= oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))} call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; {1009#(or (and (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (<= 0 oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0)))))} is VALID [2020-07-29 01:35:14,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {1009#(or (and (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (<= 0 oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0)))))} call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {1013#(and (<= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (or (and (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (<= 0 oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem7|))} is VALID [2020-07-29 01:35:14,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {1013#(and (<= |ULTIMATE.start_test_fun_#t~mem6| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (or (and (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (<= 0 oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem7|))} assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; {1017#(and (or (and (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (<= 0 oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} is VALID [2020-07-29 01:35:14,519 INFO L280 TraceCheckUtils]: 3: Hoare triple {1017#(and (or (and (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))) (not (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (<= 0 oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); {1021#(or (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem8|) (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (<= 0 oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base) (exists ((ULTIMATE.start_test_fun_~z_ref~0.offset Int) (ULTIMATE.start_test_fun_~z_ref~0.base Int)) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= |ULTIMATE.start_test_fun_#t~mem9| (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem8|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0)) (exists ((ULTIMATE.start_test_fun_~z_ref~0.offset Int) (ULTIMATE.start_test_fun_~z_ref~0.base Int)) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= |ULTIMATE.start_test_fun_#t~mem9| (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))))} is VALID [2020-07-29 01:35:14,520 INFO L280 TraceCheckUtils]: 4: Hoare triple {1021#(or (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem8|) (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (<= 0 oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base) (exists ((ULTIMATE.start_test_fun_~z_ref~0.offset Int) (ULTIMATE.start_test_fun_~z_ref~0.base Int)) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= |ULTIMATE.start_test_fun_#t~mem9| (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem8|) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0)) (exists ((ULTIMATE.start_test_fun_~z_ref~0.offset Int) (ULTIMATE.start_test_fun_~z_ref~0.base Int)) (and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset) 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= |ULTIMATE.start_test_fun_#t~mem9| (select (select |#memory_int| ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset))))))} assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; {983#(or (and (> oldRank0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:14,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:35:14,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:14,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:14,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:35:14,543 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-07-29 01:35:14,857 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 59 states and 71 transitions. Complement of second has 13 states. [2020-07-29 01:35:14,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:14,858 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:14,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. cyclomatic complexity: 8 [2020-07-29 01:35:14,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:14,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:14,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:35:14,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:35:14,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:14,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:14,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 71 transitions. [2020-07-29 01:35:14,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:35:14,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:14,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:14,862 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 25 transitions. cyclomatic complexity: 8 [2020-07-29 01:35:14,863 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:14,863 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:35:14,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:35:14,865 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:14,865 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 59 states and 71 transitions. cyclomatic complexity: 18 [2020-07-29 01:35:14,868 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:35:14,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:14,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:14,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:14,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:14,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:14,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:14,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:35:14,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:35:14,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:35:14,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:35:14,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:35:14,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:35:14,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:14,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:14,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:14,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:35:14,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:35:14,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:35:14,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:14,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:14,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 5 letters. [2020-07-29 01:35:14,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:14,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:14,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:14,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:14,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:14,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:14,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:14,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:14,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 5 letters. [2020-07-29 01:35:14,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:14,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:14,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:14,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:14,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:14,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:14,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 5 letters. [2020-07-29 01:35:14,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 5 letters. [2020-07-29 01:35:14,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 5 letters. [2020-07-29 01:35:14,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:35:14,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:35:14,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:35:14,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 5 letters. [2020-07-29 01:35:14,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 5 letters. [2020-07-29 01:35:14,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 5 letters. [2020-07-29 01:35:14,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:14,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:14,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:14,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:35:14,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:35:14,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 5 letters. [2020-07-29 01:35:14,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:35:14,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:35:14,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:35:14,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:35:14,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:35:14,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:35:14,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:35:14,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:35:14,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:35:14,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:35:14,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:35:14,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:35:14,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:35:14,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:35:14,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:35:14,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:35:14,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:35:14,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:35:14,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 25 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:35:14,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:35:14,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 71 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:35:14,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,894 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:35:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-07-29 01:35:14,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:35:14,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 13 letters. Loop has 5 letters. [2020-07-29 01:35:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:35:14,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:14,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. cyclomatic complexity: 18 [2020-07-29 01:35:14,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:35:14,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 55 states and 67 transitions. [2020-07-29 01:35:14,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-07-29 01:35:14,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-07-29 01:35:14,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 67 transitions. [2020-07-29 01:35:14,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:14,905 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 67 transitions. [2020-07-29 01:35:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 67 transitions. [2020-07-29 01:35:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2020-07-29 01:35:14,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:14,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states and 67 transitions. Second operand 48 states. [2020-07-29 01:35:14,910 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states and 67 transitions. Second operand 48 states. [2020-07-29 01:35:14,910 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 48 states. [2020-07-29 01:35:14,911 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:14,914 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2020-07-29 01:35:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2020-07-29 01:35:14,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:14,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:14,916 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 55 states and 67 transitions. [2020-07-29 01:35:14,916 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 55 states and 67 transitions. [2020-07-29 01:35:14,916 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:14,921 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2020-07-29 01:35:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2020-07-29 01:35:14,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:14,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:14,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:14,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-29 01:35:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2020-07-29 01:35:14,925 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2020-07-29 01:35:14,925 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2020-07-29 01:35:14,925 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:35:14,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 60 transitions. [2020-07-29 01:35:14,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:35:14,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:14,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:14,927 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:14,927 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2020-07-29 01:35:14,927 INFO L794 eck$LassoCheckResult]: Stem: 1106#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1104#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1105#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 1131#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1130#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 1129#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 1128#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 1125#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 1124#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 1122#L557-3 [2020-07-29 01:35:14,928 INFO L796 eck$LassoCheckResult]: Loop: 1122#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 1140#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1141#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 1107#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 1108#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 1115#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 1121#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 1122#L557-3 [2020-07-29 01:35:14,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:14,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620394, now seen corresponding path program 2 times [2020-07-29 01:35:14,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:14,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439206716] [2020-07-29 01:35:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:14,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:14,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:14,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2020-07-29 01:35:14,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:14,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291971253] [2020-07-29 01:35:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:14,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:14,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:14,992 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:14,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1864355357, now seen corresponding path program 3 times [2020-07-29 01:35:14,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:14,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113536512] [2020-07-29 01:35:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:15,048 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.interpolateCongruence(CCInterpolator.java:300) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.computeInterpolants(CCInterpolator.java:415) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:297) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:279) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:135) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:236) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:213) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:874) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 01:35:15,057 INFO L168 Benchmark]: Toolchain (without parser) took 20413.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.5 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 221.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:15,058 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:15,060 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:15,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:15,066 INFO L168 Benchmark]: Boogie Preprocessor took 28.88 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. [2020-07-29 01:35:15,067 INFO L168 Benchmark]: RCFGBuilder took 504.76 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:15,070 INFO L168 Benchmark]: BuchiAutomizer took 19211.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -38.0 MB). Peak memory consumption was 213.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:15,073 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 608.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.88 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 504.76 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19211.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -38.0 MB). Peak memory consumption was 213.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.interpolateCongruence(CCInterpolator.java:300) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...