./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.18-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.18-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 abee338f12eaa8176313da7ed567414f687b7fa7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:34:55,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:55,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:55,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:55,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:55,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:55,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:55,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:55,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:55,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:55,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:55,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:55,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:55,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:55,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:55,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:55,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:55,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:55,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:55,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:55,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:55,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:55,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:55,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:55,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:55,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:55,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:55,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:55,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:55,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:55,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:55,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:55,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:55,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:55,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:55,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:55,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:55,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:55,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:55,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:55,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:55,895 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:55,912 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:55,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:55,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:55,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:55,915 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:55,915 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:55,916 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:55,916 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:55,916 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:55,916 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:55,917 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:55,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:55,917 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:55,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:55,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:55,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:55,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:55,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:55,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:55,919 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:55,919 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:55,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:55,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:55,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:55,921 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:55,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:55,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:55,922 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:55,922 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:55,923 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:55,923 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 -> abee338f12eaa8176313da7ed567414f687b7fa7 [2020-07-29 01:34:56,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:56,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:56,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:56,244 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:56,245 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:56,246 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2020-07-29 01:34:56,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424ccfafd/6acd675794f94a80ac1709338f7f34e6/FLAG0c5f66b78 [2020-07-29 01:34:56,862 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:56,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2020-07-29 01:34:56,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424ccfafd/6acd675794f94a80ac1709338f7f34e6/FLAG0c5f66b78 [2020-07-29 01:34:57,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424ccfafd/6acd675794f94a80ac1709338f7f34e6 [2020-07-29 01:34:57,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:57,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:57,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:57,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:57,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:57,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:57" (1/1) ... [2020-07-29 01:34:57,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e36423d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:57, skipping insertion in model container [2020-07-29 01:34:57,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:57" (1/1) ... [2020-07-29 01:34:57,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:57,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:57,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:57,642 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:57,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:57,762 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:57,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:57 WrapperNode [2020-07-29 01:34:57,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:57,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:57,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:57,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:57,775 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:57" (1/1) ... [2020-07-29 01:34:57,794 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:57" (1/1) ... [2020-07-29 01:34:57,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:57,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:57,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:57,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:57,836 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:57" (1/1) ... [2020-07-29 01:34:57,836 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:57" (1/1) ... [2020-07-29 01:34:57,840 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:57" (1/1) ... [2020-07-29 01:34:57,840 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:57" (1/1) ... [2020-07-29 01:34:57,848 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:57" (1/1) ... [2020-07-29 01:34:57,854 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:57" (1/1) ... [2020-07-29 01:34:57,856 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:57" (1/1) ... [2020-07-29 01:34:57,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:57,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:57,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:57,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:57,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:57" (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:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:57,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:58,465 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:58,465 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 01:34:58,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:58 BoogieIcfgContainer [2020-07-29 01:34:58,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:58,470 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:58,470 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:58,475 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:58,476 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:58,476 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:57" (1/3) ... [2020-07-29 01:34:58,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10f8197a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:58, skipping insertion in model container [2020-07-29 01:34:58,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:58,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:57" (2/3) ... [2020-07-29 01:34:58,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10f8197a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:58, skipping insertion in model container [2020-07-29 01:34:58,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:58,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:58" (3/3) ... [2020-07-29 01:34:58,481 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.18-alloca.i [2020-07-29 01:34:58,537 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:58,538 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:58,539 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:58,539 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:58,539 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:58,540 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:58,540 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:58,540 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:58,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:34:58,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:34:58,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:58,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:58,594 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:58,595 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:58,595 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:58,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:34:58,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:34:58,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:58,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:58,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:58,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:58,612 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 8#L559-4true [2020-07-29 01:34:58,615 INFO L796 eck$LassoCheckResult]: Loop: 8#L559-4true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 14#L553-1true assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 18#L553-3true assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 9#L554true assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 6#L559-3true assume !true; 8#L559-4true [2020-07-29 01:34:58,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:34:58,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:58,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485540831] [2020-07-29 01:34:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:58,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:58,786 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:58,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash 35410170, now seen corresponding path program 1 times [2020-07-29 01:34:58,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:58,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609728696] [2020-07-29 01:34:58,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:58,883 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {23#true} is VALID [2020-07-29 01:34:58,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; {23#true} is VALID [2020-07-29 01:34:58,884 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#true} assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {23#true} is VALID [2020-07-29 01:34:58,885 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#true} assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {23#true} is VALID [2020-07-29 01:34:58,886 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} assume !true; {24#false} is VALID [2020-07-29 01:34:58,889 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:58,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609728696] [2020-07-29 01:34:58,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:58,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-29 01:34:58,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393654128] [2020-07-29 01:34:58,897 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:58,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:58,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:34:58,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:34:58,916 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2020-07-29 01:34:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:58,951 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-29 01:34:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:34:58,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:34:58,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:58,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2020-07-29 01:34:58,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:34:58,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 10 states and 14 transitions. [2020-07-29 01:34:58,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:34:58,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:34:58,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2020-07-29 01:34:58,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:58,980 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-07-29 01:34:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2020-07-29 01:34:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:34:59,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:59,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 14 transitions. Second operand 10 states. [2020-07-29 01:34:59,010 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 14 transitions. Second operand 10 states. [2020-07-29 01:34:59,012 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 10 states. [2020-07-29 01:34:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:59,014 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2020-07-29 01:34:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2020-07-29 01:34:59,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:59,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:59,016 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 14 transitions. [2020-07-29 01:34:59,016 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 14 transitions. [2020-07-29 01:34:59,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:59,018 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2020-07-29 01:34:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2020-07-29 01:34:59,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:59,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:59,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:59,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:34:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2020-07-29 01:34:59,023 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-07-29 01:34:59,023 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-07-29 01:34:59,024 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:59,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2020-07-29 01:34:59,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:34:59,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:59,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:59,025 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:59,026 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:34:59,026 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 42#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 43#L559-4 [2020-07-29 01:34:59,026 INFO L796 eck$LassoCheckResult]: Loop: 43#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 49#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 50#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 51#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 45#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 44#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 43#L559-4 [2020-07-29 01:34:59,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:59,027 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 01:34:59,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:59,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126394710] [2020-07-29 01:34:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:59,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:59,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:59,067 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:59,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:59,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1097715097, now seen corresponding path program 1 times [2020-07-29 01:34:59,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:59,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992679810] [2020-07-29 01:34:59,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:59,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#true} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {77#true} is VALID [2020-07-29 01:34:59,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#true} assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; {79#(or (not |ULTIMATE.start_test_fun_#t~short6|) (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:34:59,192 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#(or (not |ULTIMATE.start_test_fun_#t~short6|) (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {80#(<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:34:59,193 INFO L280 TraceCheckUtils]: 3: Hoare triple {80#(<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {80#(<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:34:59,194 INFO L280 TraceCheckUtils]: 4: Hoare triple {80#(<= 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_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {81#(<= 1 |ULTIMATE.start_test_fun_#t~mem11|)} is VALID [2020-07-29 01:34:59,196 INFO L280 TraceCheckUtils]: 5: Hoare triple {81#(<= 1 |ULTIMATE.start_test_fun_#t~mem11|)} assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; {78#false} is VALID [2020-07-29 01:34:59,197 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:59,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992679810] [2020-07-29 01:34:59,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:59,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:34:59,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372464711] [2020-07-29 01:34:59,198 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:59,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:34:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:34:59,200 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-07-29 01:34:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:59,382 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-29 01:34:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:34:59,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:59,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:59,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2020-07-29 01:34:59,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-29 01:34:59,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2020-07-29 01:34:59,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 01:34:59,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:34:59,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2020-07-29 01:34:59,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:59,406 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:34:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2020-07-29 01:34:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2020-07-29 01:34:59,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:59,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 23 transitions. Second operand 12 states. [2020-07-29 01:34:59,408 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 23 transitions. Second operand 12 states. [2020-07-29 01:34:59,408 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 12 states. [2020-07-29 01:34:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:59,410 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-29 01:34:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-07-29 01:34:59,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:59,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:59,411 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 17 states and 23 transitions. [2020-07-29 01:34:59,411 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 17 states and 23 transitions. [2020-07-29 01:34:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:59,414 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-29 01:34:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-07-29 01:34:59,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:59,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:59,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:59,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:34:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 01:34:59,416 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:34:59,416 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:34:59,417 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:34:59,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:34:59,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 01:34:59,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:59,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:59,418 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:59,418 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:34:59,419 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 101#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 102#L559-4 [2020-07-29 01:34:59,419 INFO L796 eck$LassoCheckResult]: Loop: 102#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 108#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 109#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 111#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 106#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 107#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 102#L559-4 [2020-07-29 01:34:59,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:59,419 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-07-29 01:34:59,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:59,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609518337] [2020-07-29 01:34:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:59,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:59,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:59,460 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:59,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:59,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1097700202, now seen corresponding path program 1 times [2020-07-29 01:34:59,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:59,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182124197] [2020-07-29 01:34:59,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:59,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {152#true} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {154#(or (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not |ULTIMATE.start_test_fun_#t~short6|))} is VALID [2020-07-29 01:34:59,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {154#(or (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (not |ULTIMATE.start_test_fun_#t~short6|))} assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; {155#(<= 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:34:59,589 INFO L280 TraceCheckUtils]: 2: Hoare triple {155#(<= 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~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {155#(<= 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:34:59,590 INFO L280 TraceCheckUtils]: 3: Hoare triple {155#(<= 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~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {155#(<= 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:34:59,591 INFO L280 TraceCheckUtils]: 4: Hoare triple {155#(<= 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~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {156#(<= 1 |ULTIMATE.start_test_fun_#t~mem9|)} is VALID [2020-07-29 01:34:59,592 INFO L280 TraceCheckUtils]: 5: Hoare triple {156#(<= 1 |ULTIMATE.start_test_fun_#t~mem9|)} assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; {153#false} is VALID [2020-07-29 01:34:59,593 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:59,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182124197] [2020-07-29 01:34:59,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:59,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:34:59,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889504220] [2020-07-29 01:34:59,595 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:59,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:59,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:34:59,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:34:59,597 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-07-29 01:34:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:59,730 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 01:34:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:34:59,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:59,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:59,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2020-07-29 01:34:59,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:59,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2020-07-29 01:34:59,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 01:34:59,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 01:34:59,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-07-29 01:34:59,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:59,752 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 01:34:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-07-29 01:34:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-07-29 01:34:59,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:59,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 19 transitions. Second operand 14 states. [2020-07-29 01:34:59,755 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 19 transitions. Second operand 14 states. [2020-07-29 01:34:59,755 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 14 states. [2020-07-29 01:34:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:59,758 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 01:34:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:34:59,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:59,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:59,761 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states and 19 transitions. [2020-07-29 01:34:59,761 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states and 19 transitions. [2020-07-29 01:34:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:59,763 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 01:34:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:34:59,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:59,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:59,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:59,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:34:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-07-29 01:34:59,773 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 01:34:59,773 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 01:34:59,773 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:34:59,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-07-29 01:34:59,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-29 01:34:59,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:59,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:59,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:59,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:59,777 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 174#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 175#L559-4 [2020-07-29 01:34:59,778 INFO L796 eck$LassoCheckResult]: Loop: 175#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 179#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 180#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 184#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 181#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 182#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 186#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 187#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 175#L559-4 [2020-07-29 01:34:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-07-29 01:34:59,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:59,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278279548] [2020-07-29 01:34:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:59,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:59,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:59,833 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:59,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:59,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1672057937, now seen corresponding path program 1 times [2020-07-29 01:34:59,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:59,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553415698] [2020-07-29 01:34:59,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:59,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {223#true} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {223#true} is VALID [2020-07-29 01:34:59,946 INFO L280 TraceCheckUtils]: 1: Hoare triple {223#true} assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; {225#(or (not |ULTIMATE.start_test_fun_#t~short6|) (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:34:59,947 INFO L280 TraceCheckUtils]: 2: Hoare triple {225#(or (not |ULTIMATE.start_test_fun_#t~short6|) (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {226#(and (= (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~mem7|) (<= 1 |ULTIMATE.start_test_fun_#t~mem8|))} is VALID [2020-07-29 01:34:59,948 INFO L280 TraceCheckUtils]: 3: Hoare triple {226#(and (= (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~mem7|) (<= 1 |ULTIMATE.start_test_fun_#t~mem8|))} assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {227#(<= 2 (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:34:59,949 INFO L280 TraceCheckUtils]: 4: Hoare triple {227#(<= 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {227#(<= 2 (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:34:59,951 INFO L280 TraceCheckUtils]: 5: Hoare triple {227#(<= 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; {228#(<= 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:34:59,952 INFO L280 TraceCheckUtils]: 6: Hoare triple {228#(<= 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~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {229#(<= 1 |ULTIMATE.start_test_fun_#t~mem9|)} is VALID [2020-07-29 01:34:59,953 INFO L280 TraceCheckUtils]: 7: Hoare triple {229#(<= 1 |ULTIMATE.start_test_fun_#t~mem9|)} assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; {224#false} is VALID [2020-07-29 01:34:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:59,954 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553415698] [2020-07-29 01:34:59,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113704008] [2020-07-29 01:34:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:35:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:00,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:35:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:00,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:00,071 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:00,421 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:00,422 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 38 treesize of output 63 [2020-07-29 01:35:00,451 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:35:00,462 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:35:00,483 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:00,527 INFO L624 ElimStorePlain]: treesize reduction 53, result has 47.0 percent of original size [2020-07-29 01:35:00,552 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-07-29 01:35:00,552 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 [2020-07-29 01:35:12,671 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:12,671 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~y_ref~0.offset]. (let ((.cse0 (select |v_#memory_int_16| ULTIMATE.start_test_fun_~x_ref~0.base))) (let ((.cse1 (select .cse0 ULTIMATE.start_test_fun_~x_ref~0.offset)) (.cse2 (select (select |v_#memory_int_16| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (and (= |#memory_int| (store |v_#memory_int_16| ULTIMATE.start_test_fun_~x_ref~0.base (store .cse0 ULTIMATE.start_test_fun_~x_ref~0.offset (+ .cse1 (- 1))))) (<= (+ .cse2 1) .cse1) (<= 1 .cse2)))) [2020-07-29 01:35:12,672 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_2, v_prenex_1, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~y_ref~0.offset]. (let ((.cse1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (or (let ((.cse0 (select (select |#memory_int| v_prenex_2) v_prenex_1))) (and (<= .cse0 .cse1) (not (= v_prenex_1 ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= 1 .cse0))) (let ((.cse2 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= .cse2 .cse1) (<= 1 .cse2))))) [2020-07-29 01:35:15,398 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:15,515 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:15,516 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2020-07-29 01:35:15,556 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:15,572 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2020-07-29 01:35:15,607 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:15,624 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:15,647 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:35:15,647 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:61, output treesize:3 [2020-07-29 01:35:15,650 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:15,651 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_prenex_2, v_prenex_1, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~y_ref~0.offset]. (let ((.cse1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (let ((.cse2 (<= .cse1 |ULTIMATE.start_test_fun_#t~mem9|))) (or (let ((.cse0 (select (select |#memory_int| v_prenex_2) v_prenex_1))) (and (not (= v_prenex_1 ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= 1 .cse0) (<= .cse0 .cse1) .cse2)) (let ((.cse3 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) .cse2 (<= .cse3 .cse1) (<= 1 .cse3)))))) [2020-07-29 01:35:15,651 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 1 |ULTIMATE.start_test_fun_#t~mem9|) [2020-07-29 01:35:15,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {223#true} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {223#true} is VALID [2020-07-29 01:35:15,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {223#true} assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; {225#(or (not |ULTIMATE.start_test_fun_#t~short6|) (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:35:15,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {225#(or (not |ULTIMATE.start_test_fun_#t~short6|) (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {239#(and (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (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|) (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))))} is VALID [2020-07-29 01:35:15,656 INFO L280 TraceCheckUtils]: 3: Hoare triple {239#(and (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (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|) (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))))} assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {243#(exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (+ (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_~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))))} is VALID [2020-07-29 01:35:15,657 INFO L280 TraceCheckUtils]: 4: Hoare triple {243#(exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (+ (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_~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~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {243#(exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (+ (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_~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))))} is VALID [2020-07-29 01:35:15,663 INFO L280 TraceCheckUtils]: 5: Hoare triple {243#(exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (+ (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_~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))))} assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; {250#(or (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (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_~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)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_1 ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= 1 (select (select |#memory_int| v_prenex_2) v_prenex_1)) (<= (select (select |#memory_int| v_prenex_2) v_prenex_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:15,669 INFO L280 TraceCheckUtils]: 6: Hoare triple {250#(or (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (<= (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_~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)))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= v_prenex_1 ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= 1 (select (select |#memory_int| v_prenex_2) v_prenex_1)) (<= (select (select |#memory_int| v_prenex_2) v_prenex_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~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {229#(<= 1 |ULTIMATE.start_test_fun_#t~mem9|)} is VALID [2020-07-29 01:35:15,670 INFO L280 TraceCheckUtils]: 7: Hoare triple {229#(<= 1 |ULTIMATE.start_test_fun_#t~mem9|)} assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; {224#false} is VALID [2020-07-29 01:35:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:15,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:35:15,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-29 01:35:15,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505598391] [2020-07-29 01:35:15,673 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:35:15,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:15,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:35:15,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=66, Unknown=2, NotChecked=0, Total=90 [2020-07-29 01:35:15,674 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2020-07-29 01:35:17,096 WARN L193 SmtUtils]: Spent 964.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-07-29 01:35:17,982 WARN L193 SmtUtils]: Spent 841.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-07-29 01:35:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:18,028 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 01:35:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:35:18,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:35:18,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:18,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2020-07-29 01:35:18,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:35:18,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2020-07-29 01:35:18,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:35:18,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:35:18,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2020-07-29 01:35:18,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:18,068 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 01:35:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2020-07-29 01:35:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 01:35:18,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:18,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 20 transitions. Second operand 16 states. [2020-07-29 01:35:18,069 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 20 transitions. Second operand 16 states. [2020-07-29 01:35:18,069 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 16 states. [2020-07-29 01:35:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:18,071 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 01:35:18,071 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-07-29 01:35:18,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:18,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:18,071 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 20 transitions. [2020-07-29 01:35:18,071 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 20 transitions. [2020-07-29 01:35:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:18,073 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 01:35:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-07-29 01:35:18,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:18,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:18,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:18,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:35:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-07-29 01:35:18,075 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 01:35:18,075 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 01:35:18,075 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:35:18,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-07-29 01:35:18,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:35:18,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:18,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:18,076 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:35:18,076 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:18,077 INFO L794 eck$LassoCheckResult]: Stem: 284#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 280#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 281#L559-4 [2020-07-29 01:35:18,077 INFO L796 eck$LassoCheckResult]: Loop: 281#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 285#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 286#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 290#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 291#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 282#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 283#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 289#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 281#L559-4 [2020-07-29 01:35:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:18,077 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2020-07-29 01:35:18,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:18,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404845932] [2020-07-29 01:35:18,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,097 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,100 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:18,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:18,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1657743362, now seen corresponding path program 1 times [2020-07-29 01:35:18,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:18,101 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953370323] [2020-07-29 01:35:18,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:18,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:18,125 INFO L82 PathProgramCache]: Analyzing trace with hash -967181888, now seen corresponding path program 1 times [2020-07-29 01:35:18,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:18,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759855923] [2020-07-29 01:35:18,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,142 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,190 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:18,365 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2020-07-29 01:35:18,610 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2020-07-29 01:35:18,731 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:18,732 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:18,732 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:18,732 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:18,732 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:18,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:18,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:18,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:18,733 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration5_Lasso [2020-07-29 01:35:18,733 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:18,733 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:18,777 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:18,791 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:18,798 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:18,802 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:18,805 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:18,811 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:18,816 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:18,819 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:18,824 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:19,040 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-07-29 01:35:19,166 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:19,173 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:19,178 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:19,183 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:19,187 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:19,193 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:19,198 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:19,202 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:19,206 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:19,210 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:19,214 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:19,220 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:19,224 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:19,228 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:20,183 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:20,189 INFO L489 LassoAnalysis]: Using template 'affine'. 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:20,194 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:20,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,205 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:20,238 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:20,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,244 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:20,270 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:20,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,283 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:20,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:20,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,327 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:20,352 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:20,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:20,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:20,365 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:20,391 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:20,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,398 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:20,438 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:20,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:20,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:20,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:20,443 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:20,483 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:20,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:20,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:20,494 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:20,516 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:20,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:20,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:20,540 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:20,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:20,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:20,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:20,572 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:20,595 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:20,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:20,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:20,606 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:20,640 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:20,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:20,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:20,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:20,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:20,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:20,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:20,662 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:20,683 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:35:20,683 INFO L444 ModelExtractionUtils]: 23 out of 28 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:20,701 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:20,705 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:20,705 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:20,706 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)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2020-07-29 01:35:20,891 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-07-29 01:35:20,895 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0;" "assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0;" "assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;" "call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12;" "call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;" [2020-07-29 01:35:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:20,909 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:20,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:20,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:20,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:20,952 INFO L280 TraceCheckUtils]: 0: Hoare triple {337#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {337#unseeded} is VALID [2020-07-29 01:35:20,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {337#unseeded} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); {337#unseeded} is VALID [2020-07-29 01:35:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:20,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:35:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:20,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:20,996 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:21,046 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-07-29 01:35:21,051 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:21,056 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-29 01:35:21,068 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:21,083 INFO L624 ElimStorePlain]: treesize reduction 2, result has 75.0 percent of original size [2020-07-29 01:35:21,084 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-29 01:35:21,084 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:6 [2020-07-29 01:35:21,087 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:21,088 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|]. (let ((.cse1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (let ((.cse0 (>= oldRank0 .cse1))) (or (and .cse0 (not |ULTIMATE.start_test_fun_#t~short6|)) (and .cse0 |ULTIMATE.start_test_fun_#t~short6| (<= 1 .cse1))))) [2020-07-29 01:35:21,088 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (or (not |ULTIMATE.start_test_fun_#t~short6|) (<= 1 oldRank0)) [2020-07-29 01:35:21,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {340#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {340#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:35:21,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {340#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; {416#(or (not |ULTIMATE.start_test_fun_#t~short6|) (<= 1 oldRank0))} is VALID [2020-07-29 01:35:21,142 INFO L280 TraceCheckUtils]: 2: Hoare triple {416#(or (not |ULTIMATE.start_test_fun_#t~short6|) (<= 1 oldRank0))} assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {420#(<= 1 oldRank0)} is VALID [2020-07-29 01:35:21,143 INFO L280 TraceCheckUtils]: 3: Hoare triple {420#(<= 1 oldRank0)} assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {420#(<= 1 oldRank0)} is VALID [2020-07-29 01:35:21,143 INFO L280 TraceCheckUtils]: 4: Hoare triple {420#(<= 1 oldRank0)} call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {420#(<= 1 oldRank0)} is VALID [2020-07-29 01:35:21,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {420#(<= 1 oldRank0)} assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; {420#(<= 1 oldRank0)} is VALID [2020-07-29 01:35:21,145 INFO L280 TraceCheckUtils]: 6: Hoare triple {420#(<= 1 oldRank0)} call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {433#(and (<= 1 oldRank0) (<= (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~mem11|))} is VALID [2020-07-29 01:35:21,147 INFO L280 TraceCheckUtils]: 7: Hoare triple {433#(and (<= 1 oldRank0) (<= (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~mem11|))} assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; {405#(or (and (> oldRank0 (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:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:35:21,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:35:21,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:21,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:35:21,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,169 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:35:21,170 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-07-29 01:35:21,467 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 40 states and 53 transitions. Complement of second has 10 states. [2020-07-29 01:35:21,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:21,467 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:21,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 01:35:21,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:35:21,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:21,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2020-07-29 01:35:21,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:35:21,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,475 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 01:35:21,479 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 01:35:21,479 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:35:21,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:21,481 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:21,481 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 53 transitions. cyclomatic complexity: 16 [2020-07-29 01:35:21,484 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:35:21,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:35:21,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:35:21,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:35:21,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:21,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:21,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:21,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:35:21,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:35:21,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:35:21,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:35:21,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:35:21,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:35:21,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:35:21,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:35:21,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:35:21,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:21,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:21,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:21,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:35:21,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:35:21,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:35:21,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:21,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:21,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:21,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:21,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:21,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:21,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:35:21,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:35:21,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:35:21,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:35:21,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:35:21,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:35:21,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:21,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:21,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:21,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:21,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:21,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:21,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:35:21,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:35:21,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:35:21,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:35:21,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:35:21,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:35:21,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:35:21,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:35:21,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:35:21,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:21,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:21,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:21,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 8 letters. [2020-07-29 01:35:21,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 8 letters. [2020-07-29 01:35:21,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 8 letters. [2020-07-29 01:35:21,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 8 letters. [2020-07-29 01:35:21,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 8 letters. [2020-07-29 01:35:21,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 8 letters. [2020-07-29 01:35:21,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:35:21,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:35:21,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:35:21,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:21,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:21,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:21,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:21,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:21,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:21,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:35:21,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:35:21,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:35:21,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:21,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:21,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:21,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 10 letters. [2020-07-29 01:35:21,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 10 letters. [2020-07-29 01:35:21,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 10 letters. [2020-07-29 01:35:21,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:35:21,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:35:21,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:35:21,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:35:21,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:35:21,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:35:21,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 10 letters. [2020-07-29 01:35:21,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 10 letters. [2020-07-29 01:35:21,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 10 letters. [2020-07-29 01:35:21,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 10 letters. [2020-07-29 01:35:21,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 10 letters. [2020-07-29 01:35:21,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 10 letters. [2020-07-29 01:35:21,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:35:21,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:35:21,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:35:21,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:35:21,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:35:21,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:35:21,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:21,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:21,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:21,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:21,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:21,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 53 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:21,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,521 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:35:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-29 01:35:21,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:35:21,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:35:21,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 16 letters. [2020-07-29 01:35:21,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. cyclomatic complexity: 16 [2020-07-29 01:35:21,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:35:21,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 51 transitions. [2020-07-29 01:35:21,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:35:21,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 01:35:21,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2020-07-29 01:35:21,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:21,529 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2020-07-29 01:35:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2020-07-29 01:35:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2020-07-29 01:35:21,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:21,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 51 transitions. Second operand 30 states. [2020-07-29 01:35:21,533 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 51 transitions. Second operand 30 states. [2020-07-29 01:35:21,533 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand 30 states. [2020-07-29 01:35:21,533 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:21,537 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2020-07-29 01:35:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2020-07-29 01:35:21,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:21,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:21,538 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 38 states and 51 transitions. [2020-07-29 01:35:21,538 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 38 states and 51 transitions. [2020-07-29 01:35:21,539 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:21,542 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2020-07-29 01:35:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2020-07-29 01:35:21,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:21,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:21,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:21,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:35:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-07-29 01:35:21,544 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-29 01:35:21,544 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-29 01:35:21,544 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:35:21,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2020-07-29 01:35:21,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:35:21,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,549 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:35:21,550 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1] [2020-07-29 01:35:21,550 INFO L794 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 495#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 496#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 508#L553-1 [2020-07-29 01:35:21,550 INFO L796 eck$LassoCheckResult]: Loop: 508#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 509#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 514#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 504#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 505#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 517#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 521#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 520#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 519#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 498#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 508#L553-1 [2020-07-29 01:35:21,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:21,550 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:35:21,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:21,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910332198] [2020-07-29 01:35:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:21,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:21,596 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:21,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:21,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1479493138, now seen corresponding path program 2 times [2020-07-29 01:35:21,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:21,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095548200] [2020-07-29 01:35:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:21,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:21,657 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:21,664 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash 376307409, now seen corresponding path program 1 times [2020-07-29 01:35:21,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:21,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069747496] [2020-07-29 01:35:21,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:21,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:21,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:21,729 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:21,953 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2020-07-29 01:35:22,269 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2020-07-29 01:35:22,396 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-07-29 01:35:22,399 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:22,399 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:22,399 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:22,400 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:22,400 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:22,400 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:22,400 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:22,400 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:22,400 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration6_Lasso [2020-07-29 01:35:22,400 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:22,400 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:22,435 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:22,441 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:22,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:22,449 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:22,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:22,460 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:22,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:22,469 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:22,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:22,482 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:22,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:22,491 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:22,495 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:22,499 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:22,503 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:22,509 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:22,518 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:22,524 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:22,528 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:22,532 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:22,536 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:22,540 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:23,135 WARN L193 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2020-07-29 01:35:23,262 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-07-29 01:35:24,338 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-07-29 01:35:24,509 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:24,510 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:35:24,520 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:24,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,525 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:24,554 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:24,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,563 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:24,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:24,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,595 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,628 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:24,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,641 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:24,665 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:24,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,672 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:24,704 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:24,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,711 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:24,737 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:24,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,740 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,764 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:24,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,770 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,793 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:24,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,796 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 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:24,820 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:24,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,824 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:24,847 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:24,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,850 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:24,872 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:24,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,877 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:24,901 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:24,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,909 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,939 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:24,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,943 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:24,966 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:24,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,969 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:24,970 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:24,998 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:24,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:25,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:25,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:25,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:25,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:25,006 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:25,030 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:25,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:25,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:25,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:25,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:25,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:25,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:25,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:25,034 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:25,056 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:25,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:25,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:25,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:25,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:25,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:25,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:25,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:25,066 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:25,096 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:25,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:25,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:25,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:25,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:25,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:25,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:25,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:25,099 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:25,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:25,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:25,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:25,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:25,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:25,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:25,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:25,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:25,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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:25,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:25,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:25,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:25,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:25,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:25,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:25,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:25,160 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:25,183 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:25,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:25,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:25,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:25,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:25,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:25,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:25,210 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) [2020-07-29 01:35:25,241 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:25,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:25,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:25,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:25,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:25,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:25,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:25,254 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:25,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:25,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:25,290 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:35:25,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:25,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:25,297 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-07-29 01:35:25,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:25,317 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:25,356 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 01:35:25,356 INFO L444 ModelExtractionUtils]: 16 out of 34 variables were initially zero. Simplification set additionally 16 variables to zero. 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:25,359 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:25,361 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:25,361 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:25,362 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite ULTIMATE.start_test_fun_#t~short6 1 0)_2) = 1*v_rep(ite ULTIMATE.start_test_fun_#t~short6 1 0)_2 Supporting invariants [] [2020-07-29 01:35:25,420 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-07-29 01:35:25,424 INFO L393 LassoCheck]: Loop: "assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0;" "assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;" "call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);" "assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;" "call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);" "assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;" "call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);" "assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;" "call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0;" [2020-07-29 01:35:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:25,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:25,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:25,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {663#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {663#unseeded} is VALID [2020-07-29 01:35:25,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {663#unseeded} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); {663#unseeded} is VALID [2020-07-29 01:35:25,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {663#unseeded} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {663#unseeded} is VALID [2020-07-29 01:35:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:25,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:35:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:25,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:25,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {666#(>= oldRank0 (ite |ULTIMATE.start_test_fun_#t~short6| 1 0))} assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; {742#(<= 1 oldRank0)} is VALID [2020-07-29 01:35:25,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {742#(<= 1 oldRank0)} assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {742#(<= 1 oldRank0)} is VALID [2020-07-29 01:35:25,602 INFO L280 TraceCheckUtils]: 2: Hoare triple {742#(<= 1 oldRank0)} assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {742#(<= 1 oldRank0)} is VALID [2020-07-29 01:35:25,603 INFO L280 TraceCheckUtils]: 3: Hoare triple {742#(<= 1 oldRank0)} call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {742#(<= 1 oldRank0)} is VALID [2020-07-29 01:35:25,603 INFO L280 TraceCheckUtils]: 4: Hoare triple {742#(<= 1 oldRank0)} assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; {742#(<= 1 oldRank0)} is VALID [2020-07-29 01:35:25,604 INFO L280 TraceCheckUtils]: 5: Hoare triple {742#(<= 1 oldRank0)} call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {742#(<= 1 oldRank0)} is VALID [2020-07-29 01:35:25,607 INFO L280 TraceCheckUtils]: 6: Hoare triple {742#(<= 1 oldRank0)} assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; {742#(<= 1 oldRank0)} is VALID [2020-07-29 01:35:25,608 INFO L280 TraceCheckUtils]: 7: Hoare triple {742#(<= 1 oldRank0)} call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {764#(and (<= 1 oldRank0) (<= (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|))} is VALID [2020-07-29 01:35:25,609 INFO L280 TraceCheckUtils]: 8: Hoare triple {764#(and (<= 1 oldRank0) (<= (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|))} assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; {768#(and (<= 1 oldRank0) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 0))} is VALID [2020-07-29 01:35:25,610 INFO L280 TraceCheckUtils]: 9: Hoare triple {768#(and (<= 1 oldRank0) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 0))} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {731#(or (and (> oldRank0 (ite |ULTIMATE.start_test_fun_#t~short6| 1 0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 01:35:25,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:35:25,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:25,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 10 letters. [2020-07-29 01:35:25,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,628 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:35:25,628 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-29 01:35:25,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 73 states and 98 transitions. Complement of second has 10 states. [2020-07-29 01:35:25,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:25,802 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:25,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. cyclomatic complexity: 12 [2020-07-29 01:35:25,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:25,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:25,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:35:25,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:25,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:25,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:25,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 98 transitions. [2020-07-29 01:35:25,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:35:25,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:25,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:25,808 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 39 transitions. cyclomatic complexity: 12 [2020-07-29 01:35:25,810 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:35:25,810 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:35:25,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:25,811 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:25,811 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 73 states and 98 transitions. cyclomatic complexity: 32 [2020-07-29 01:35:25,812 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:35:25,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 10 letters. [2020-07-29 01:35:25,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 10 letters. [2020-07-29 01:35:25,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 3 letters. Loop has 10 letters. [2020-07-29 01:35:25,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:25,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:25,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:25,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 73 letters. Loop has 73 letters. [2020-07-29 01:35:25,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 73 letters. Loop has 73 letters. [2020-07-29 01:35:25,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 73 letters. Loop has 73 letters. [2020-07-29 01:35:25,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:25,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:25,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:25,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:25,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:25,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:25,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:35:25,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:35:25,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 5 letters. Loop has 10 letters. [2020-07-29 01:35:25,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:35:25,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:35:25,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:35:25,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:35:25,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:35:25,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:35:25,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:25,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:25,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:25,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:35:25,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:35:25,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:35:25,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:35:25,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:35:25,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:35:25,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:35:25,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:35:25,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:35:25,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 10 letters. [2020-07-29 01:35:25,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 10 letters. [2020-07-29 01:35:25,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 3 letters. Loop has 10 letters. [2020-07-29 01:35:25,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 10 letters. [2020-07-29 01:35:25,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 10 letters. [2020-07-29 01:35:25,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 4 letters. Loop has 10 letters. [2020-07-29 01:35:25,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:25,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:25,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:25,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:25,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:25,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:25,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:25,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:25,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:25,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 98 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:25,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,844 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:35:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-07-29 01:35:25,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 10 letters. [2020-07-29 01:35:25,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 13 letters. Loop has 10 letters. [2020-07-29 01:35:25,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 20 letters. [2020-07-29 01:35:25,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 98 transitions. cyclomatic complexity: 32 [2020-07-29 01:35:25,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:35:25,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 89 transitions. [2020-07-29 01:35:25,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 01:35:25,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 01:35:25,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 89 transitions. [2020-07-29 01:35:25,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:25,855 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 89 transitions. [2020-07-29 01:35:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 89 transitions. [2020-07-29 01:35:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2020-07-29 01:35:25,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:25,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states and 89 transitions. Second operand 55 states. [2020-07-29 01:35:25,860 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states and 89 transitions. Second operand 55 states. [2020-07-29 01:35:25,860 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand 55 states. [2020-07-29 01:35:25,861 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:25,865 INFO L93 Difference]: Finished difference Result 69 states and 99 transitions. [2020-07-29 01:35:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2020-07-29 01:35:25,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:25,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:25,867 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 65 states and 89 transitions. [2020-07-29 01:35:25,867 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 65 states and 89 transitions. [2020-07-29 01:35:25,867 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:25,872 INFO L93 Difference]: Finished difference Result 75 states and 106 transitions. [2020-07-29 01:35:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 106 transitions. [2020-07-29 01:35:25,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:25,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:25,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:25,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-29 01:35:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2020-07-29 01:35:25,877 INFO L711 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. [2020-07-29 01:35:25,877 INFO L591 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. [2020-07-29 01:35:25,877 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:35:25,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 79 transitions. [2020-07-29 01:35:25,879 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:35:25,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:25,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:25,879 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:35:25,879 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:25,880 INFO L794 eck$LassoCheckResult]: Stem: 868#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 860#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 861#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 903#L553-1 assume !test_fun_#t~short6; 870#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 880#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 873#L555-3 [2020-07-29 01:35:25,880 INFO L796 eck$LassoCheckResult]: Loop: 873#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 874#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 873#L555-3 [2020-07-29 01:35:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash 889571371, now seen corresponding path program 1 times [2020-07-29 01:35:25,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:25,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634373504] [2020-07-29 01:35:25,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:25,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {1121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1121#true} is VALID [2020-07-29 01:35:25,905 INFO L280 TraceCheckUtils]: 1: Hoare triple {1121#true} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); {1121#true} is VALID [2020-07-29 01:35:25,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {1121#true} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {1121#true} is VALID [2020-07-29 01:35:25,907 INFO L280 TraceCheckUtils]: 3: Hoare triple {1121#true} assume !test_fun_#t~short6; {1123#(not |ULTIMATE.start_test_fun_#t~short6|)} is VALID [2020-07-29 01:35:25,908 INFO L280 TraceCheckUtils]: 4: Hoare triple {1123#(not |ULTIMATE.start_test_fun_#t~short6|)} assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {1122#false} is VALID [2020-07-29 01:35:25,908 INFO L280 TraceCheckUtils]: 5: Hoare triple {1122#false} assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {1122#false} is VALID [2020-07-29 01:35:25,908 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:25,908 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634373504] [2020-07-29 01:35:25,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:25,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:35:25,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038510524] [2020-07-29 01:35:25,910 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:35:25,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:25,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2020-07-29 01:35:25,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:25,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605193300] [2020-07-29 01:35:25,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:25,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:25,917 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:25,918 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:25,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:25,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:35:25,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:35:25,963 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. cyclomatic complexity: 30 Second operand 3 states. [2020-07-29 01:35:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:26,002 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2020-07-29 01:35:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:35:26,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:26,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:26,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 75 transitions. [2020-07-29 01:35:26,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:35:26,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 53 states and 67 transitions. [2020-07-29 01:35:26,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:35:26,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:35:26,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2020-07-29 01:35:26,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:26,032 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2020-07-29 01:35:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2020-07-29 01:35:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-29 01:35:26,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:26,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states and 67 transitions. Second operand 53 states. [2020-07-29 01:35:26,038 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states and 67 transitions. Second operand 53 states. [2020-07-29 01:35:26,038 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand 53 states. [2020-07-29 01:35:26,039 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:26,043 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2020-07-29 01:35:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2020-07-29 01:35:26,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:26,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:26,047 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states and 67 transitions. [2020-07-29 01:35:26,048 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states and 67 transitions. [2020-07-29 01:35:26,048 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:26,051 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2020-07-29 01:35:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2020-07-29 01:35:26,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:26,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:26,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:26,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-29 01:35:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2020-07-29 01:35:26,059 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2020-07-29 01:35:26,060 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2020-07-29 01:35:26,060 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:35:26,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 67 transitions. [2020-07-29 01:35:26,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:35:26,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:26,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:26,063 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:35:26,066 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:26,067 INFO L794 eck$LassoCheckResult]: Stem: 1193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1185#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 1186#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1230#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1199#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1204#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1194#L555-3 [2020-07-29 01:35:26,067 INFO L796 eck$LassoCheckResult]: Loop: 1194#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1195#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 1194#L555-3 [2020-07-29 01:35:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2020-07-29 01:35:26,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:26,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607855990] [2020-07-29 01:35:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:26,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:26,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:26,102 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:26,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2020-07-29 01:35:26,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:26,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769970182] [2020-07-29 01:35:26,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:26,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:26,115 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:26,118 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:26,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash 177749422, now seen corresponding path program 1 times [2020-07-29 01:35:26,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:26,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391204426] [2020-07-29 01:35:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:26,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:26,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:26,152 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:26,520 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2020-07-29 01:35:26,644 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:26,644 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:26,644 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:26,645 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:26,645 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:26,645 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,645 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:26,645 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:26,645 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration8_Lasso [2020-07-29 01:35:26,646 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:26,646 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:26,672 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:26,677 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:26,688 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:26,691 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:26,702 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:26,896 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2020-07-29 01:35:26,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:35:26,939 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:26,944 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:26,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:35:26,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:35:26,957 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:26,961 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:26,965 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:26,969 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:26,973 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:26,978 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:26,981 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:26,985 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:26,990 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:27,000 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:27,004 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:27,008 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:27,012 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:27,016 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:27,840 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:27,840 INFO L489 LassoAnalysis]: Using template 'affine'. 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:27,851 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:27,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:27,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:27,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:27,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:27,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:27,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:27,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:27,855 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:27,877 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:27,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:27,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:27,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:27,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:27,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:27,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:27,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:27,880 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:27,905 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:27,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:27,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:27,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:27,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:27,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:27,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:27,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:27,908 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:27,931 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:27,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:27,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:27,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:27,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:27,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:27,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:27,937 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:27,959 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:27,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:27,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:27,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:27,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:27,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:27,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:27,966 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 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:27,987 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:27,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:27,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:27,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:27,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:27,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:27,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:27,996 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:28,018 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:28,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:28,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:28,033 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:28,073 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:28,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:28,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:28,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:28,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:28,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:28,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:28,091 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:28,099 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:35:28,099 INFO L444 ModelExtractionUtils]: 23 out of 28 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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:28,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:28,103 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:28,103 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:28,103 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2020-07-29 01:35:28,151 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2020-07-29 01:35:28,154 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);" "assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;" [2020-07-29 01:35:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:28,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:28,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:28,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:28,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:28,210 INFO L280 TraceCheckUtils]: 0: Hoare triple {1423#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1423#unseeded} is VALID [2020-07-29 01:35:28,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {1423#unseeded} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); {1423#unseeded} is VALID [2020-07-29 01:35:28,211 INFO L280 TraceCheckUtils]: 2: Hoare triple {1423#unseeded} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {1423#unseeded} is VALID [2020-07-29 01:35:28,212 INFO L280 TraceCheckUtils]: 3: Hoare triple {1423#unseeded} assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; {1423#unseeded} is VALID [2020-07-29 01:35:28,213 INFO L280 TraceCheckUtils]: 4: Hoare triple {1423#unseeded} assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {1423#unseeded} is VALID [2020-07-29 01:35:28,213 INFO L280 TraceCheckUtils]: 5: Hoare triple {1423#unseeded} assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {1423#unseeded} is VALID [2020-07-29 01:35:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:28,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:35:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:28,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:28,241 INFO L280 TraceCheckUtils]: 0: Hoare triple {1426#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {1496#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem9| (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:28,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {1496#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem9| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; {1476#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:28,242 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:28,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:28,251 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:28,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:28,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,252 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:28,252 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20 Second operand 3 states. [2020-07-29 01:35:28,387 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 149 states and 188 transitions. Complement of second has 6 states. [2020-07-29 01:35:28,388 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:28,388 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:28,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 67 transitions. cyclomatic complexity: 20 [2020-07-29 01:35:28,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:28,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:28,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:28,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:28,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:28,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:28,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 188 transitions. [2020-07-29 01:35:28,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:35:28,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:28,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:28,392 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 67 transitions. cyclomatic complexity: 20 [2020-07-29 01:35:28,393 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:35:28,393 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:28,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:28,394 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:28,394 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 149 states and 188 transitions. cyclomatic complexity: 54 [2020-07-29 01:35:28,395 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:35:28,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:28,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:28,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:28,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:28,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:28,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:28,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:28,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:28,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:28,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 149 letters. Loop has 149 letters. [2020-07-29 01:35:28,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 149 letters. Loop has 149 letters. [2020-07-29 01:35:28,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 149 letters. Loop has 149 letters. [2020-07-29 01:35:28,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:35:28,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:35:28,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:35:28,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:28,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:28,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:28,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:28,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:28,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:28,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:28,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:28,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:35:28,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:28,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:28,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:28,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:28,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:28,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:28,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:28,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:28,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:28,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:28,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:28,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:28,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 2 letters. [2020-07-29 01:35:28,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 01:35:28,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 19 letters. Loop has 2 letters. [2020-07-29 01:35:28,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:28,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:28,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:28,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 67 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:28,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:28,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 149 states and 188 transitions. cyclomatic complexity: 54 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:28,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,413 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-07-29 01:35:28,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:35:28,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:28,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:35:28,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:28,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. cyclomatic complexity: 54 [2020-07-29 01:35:28,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:35:28,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 56 states and 67 transitions. [2020-07-29 01:35:28,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:35:28,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:35:28,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2020-07-29 01:35:28,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:28,422 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2020-07-29 01:35:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2020-07-29 01:35:28,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2020-07-29 01:35:28,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:28,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states and 67 transitions. Second operand 30 states. [2020-07-29 01:35:28,425 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states and 67 transitions. Second operand 30 states. [2020-07-29 01:35:28,426 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 30 states. [2020-07-29 01:35:28,426 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:28,428 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2020-07-29 01:35:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2020-07-29 01:35:28,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:28,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:28,429 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 56 states and 67 transitions. [2020-07-29 01:35:28,429 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 56 states and 67 transitions. [2020-07-29 01:35:28,429 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:28,431 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2020-07-29 01:35:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2020-07-29 01:35:28,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:28,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:28,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:28,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:35:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-29 01:35:28,433 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-29 01:35:28,434 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-29 01:35:28,434 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:35:28,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2020-07-29 01:35:28,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:28,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:28,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:28,435 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:28,435 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:28,435 INFO L794 eck$LassoCheckResult]: Stem: 1664#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1658#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 1659#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1672#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1670#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1671#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1680#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1679#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1677#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1660#L559-1 [2020-07-29 01:35:28,436 INFO L796 eck$LassoCheckResult]: Loop: 1660#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1661#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1660#L559-1 [2020-07-29 01:35:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1215726572, now seen corresponding path program 1 times [2020-07-29 01:35:28,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:28,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277041542] [2020-07-29 01:35:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:28,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:28,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:28,458 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:28,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:28,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 1 times [2020-07-29 01:35:28,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:28,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787418948] [2020-07-29 01:35:28,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:28,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:28,464 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:28,465 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:28,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash 82132647, now seen corresponding path program 2 times [2020-07-29 01:35:28,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:28,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964792717] [2020-07-29 01:35:28,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:28,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:28,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:28,489 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:28,917 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2020-07-29 01:35:29,064 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-07-29 01:35:29,070 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:29,070 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:29,071 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:29,071 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:29,071 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:29,071 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:29,071 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:29,071 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:29,071 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration9_Lasso [2020-07-29 01:35:29,071 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:29,071 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:29,093 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:29,097 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:29,100 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:29,104 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:29,108 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:29,113 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:29,117 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:29,120 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:29,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:29,130 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:29,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:29,144 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:29,148 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:29,152 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:29,157 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:29,162 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:29,423 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-07-29 01:35:29,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:29,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:29,482 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:29,487 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:29,491 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:29,496 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:30,327 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:30,328 INFO L489 LassoAnalysis]: Using template 'affine'. 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:30,331 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:30,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:30,334 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:30,357 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:30,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:30,360 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) [2020-07-29 01:35:30,385 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:30,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,391 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:30,413 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:30,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:30,416 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:30,437 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:30,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:30,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:30,444 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 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:30,466 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:30,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:30,469 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,492 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:30,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:30,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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:30,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:30,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,537 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:30,569 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:30,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:30,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:30,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:30,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,603 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,629 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:30,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:30,633 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,657 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:30,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:30,660 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,682 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:30,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:30,686 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 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,709 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:30,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:30,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:30,716 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:30,738 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:30,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:30,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:30,742 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 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,764 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:30,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:30,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:30,770 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:30,792 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:30,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:30,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:30,805 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 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,828 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:30,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:30,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:30,834 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 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,857 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:30,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:30,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:30,865 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 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,887 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:30,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:30,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:30,893 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,915 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:30,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:30,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:30,922 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 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,943 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:30,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:30,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:30,956 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 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:30,977 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:30,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:30,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:30,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:30,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:30,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:30,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:30,998 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:31,013 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:35:31,014 INFO L444 ModelExtractionUtils]: 24 out of 31 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 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:31,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:31,018 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:35:31,019 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:31,019 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem11) = 1*ULTIMATE.start_test_fun_#t~mem11 Supporting invariants [1*ULTIMATE.start_test_fun_#t~mem11 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 >= 0] [2020-07-29 01:35:31,072 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 01:35:31,078 INFO L393 LassoCheck]: Loop: "assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12;" "call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" [2020-07-29 01:35:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:31,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:31,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:35:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:31,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:31,147 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1871#unseeded} is VALID [2020-07-29 01:35:31,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#unseeded} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); {1871#unseeded} is VALID [2020-07-29 01:35:31,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {1871#unseeded} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {1871#unseeded} is VALID [2020-07-29 01:35:31,150 INFO L280 TraceCheckUtils]: 3: Hoare triple {1871#unseeded} assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; {1871#unseeded} is VALID [2020-07-29 01:35:31,150 INFO L280 TraceCheckUtils]: 4: Hoare triple {1871#unseeded} assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {1871#unseeded} is VALID [2020-07-29 01:35:31,150 INFO L280 TraceCheckUtils]: 5: Hoare triple {1871#unseeded} assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {1871#unseeded} is VALID [2020-07-29 01:35:31,151 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#unseeded} call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {1871#unseeded} is VALID [2020-07-29 01:35:31,151 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#unseeded} assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; {1871#unseeded} is VALID [2020-07-29 01:35:31,152 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#unseeded} call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {1930#(and (>= (+ |ULTIMATE.start_test_fun_#t~mem11| (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) 0) unseeded)} is VALID [2020-07-29 01:35:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:31,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:35:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:31,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:31,224 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-07-29 01:35:31,229 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:31,234 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:31,235 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:35:31,235 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2020-07-29 01:35:34,104 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:34,104 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_125|]. (let ((.cse0 (select |v_#memory_int_125| ULTIMATE.start_test_fun_~y_ref~0.base))) (let ((.cse1 (select .cse0 ULTIMATE.start_test_fun_~y_ref~0.offset))) (and (<= 1 oldRank0) (= |#memory_int| (store |v_#memory_int_125| ULTIMATE.start_test_fun_~y_ref~0.base (store .cse0 ULTIMATE.start_test_fun_~y_ref~0.offset (+ .cse1 (- 1))))) (<= .cse1 oldRank0)))) [2020-07-29 01:35:34,105 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 1 oldRank0) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) oldRank0)) [2020-07-29 01:35:34,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {1931#(and (>= (+ |ULTIMATE.start_test_fun_#t~mem11| (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) 0) (>= oldRank0 |ULTIMATE.start_test_fun_#t~mem11|))} assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; {1963#(and (<= 1 oldRank0) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) oldRank0))} is VALID [2020-07-29 01:35:34,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {1963#(and (<= 1 oldRank0) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) oldRank0))} call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {1933#(and (>= (+ |ULTIMATE.start_test_fun_#t~mem11| (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) 0) (or (and (> oldRank0 |ULTIMATE.start_test_fun_#t~mem11|) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:35:34,132 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:34,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:34,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:34,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:34,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,151 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:34,151 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 01:35:34,227 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 61 states and 76 transitions. Complement of second has 5 states. [2020-07-29 01:35:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:34,228 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:34,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. cyclomatic complexity: 10 [2020-07-29 01:35:34,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:34,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:34,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:34,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:34,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:34,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:34,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 76 transitions. [2020-07-29 01:35:34,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:34,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:34,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:34,231 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 37 transitions. cyclomatic complexity: 10 [2020-07-29 01:35:34,231 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:34,232 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:34,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:34,232 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:34,233 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 61 states and 76 transitions. cyclomatic complexity: 22 [2020-07-29 01:35:34,233 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:34,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:34,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:34,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:34,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:34,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:34,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:34,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:34,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:34,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 22 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:34,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:35:34,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:35:34,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 22 Stem has 61 letters. Loop has 61 letters. [2020-07-29 01:35:34,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:34,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:34,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 22 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:34,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:34,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:34,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:34,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:34,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:34,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:34,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:34,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:34,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:35:34,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:34,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:34,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:34,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:35:34,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:35:34,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 22 Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:35:34,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 37 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:34,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:34,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 76 transitions. cyclomatic complexity: 22 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:34,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,247 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2020-07-29 01:35:34,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:34,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:35:34,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:35:34,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:34,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. cyclomatic complexity: 22 [2020-07-29 01:35:34,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:34,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 54 states and 66 transitions. [2020-07-29 01:35:34,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:35:34,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:35:34,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2020-07-29 01:35:34,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:34,252 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2020-07-29 01:35:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2020-07-29 01:35:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2020-07-29 01:35:34,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:34,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states and 66 transitions. Second operand 47 states. [2020-07-29 01:35:34,256 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states and 66 transitions. Second operand 47 states. [2020-07-29 01:35:34,256 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 47 states. [2020-07-29 01:35:34,256 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:34,258 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2020-07-29 01:35:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2020-07-29 01:35:34,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:34,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:34,259 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 54 states and 66 transitions. [2020-07-29 01:35:34,260 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 54 states and 66 transitions. [2020-07-29 01:35:34,260 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:34,262 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2020-07-29 01:35:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2020-07-29 01:35:34,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:34,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:34,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:34,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-29 01:35:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2020-07-29 01:35:34,264 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2020-07-29 01:35:34,264 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2020-07-29 01:35:34,264 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:35:34,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 57 transitions. [2020-07-29 01:35:34,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:34,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:34,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:34,266 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1] [2020-07-29 01:35:34,266 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:34,266 INFO L794 eck$LassoCheckResult]: Stem: 2042#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2036#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 2037#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 2051#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 2044#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2081#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 2079#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2040#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 2041#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2056#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 2062#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 2061#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 2060#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2059#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 2058#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2057#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 2055#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2038#L559-1 [2020-07-29 01:35:34,266 INFO L796 eck$LassoCheckResult]: Loop: 2038#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 2039#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2038#L559-1 [2020-07-29 01:35:34,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:34,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2055714993, now seen corresponding path program 2 times [2020-07-29 01:35:34,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:34,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541243262] [2020-07-29 01:35:34,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:34,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {2276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2276#true} is VALID [2020-07-29 01:35:34,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {2276#true} havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;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~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); {2276#true} is VALID [2020-07-29 01:35:34,319 INFO L280 TraceCheckUtils]: 2: Hoare triple {2276#true} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {2276#true} is VALID [2020-07-29 01:35:34,319 INFO L280 TraceCheckUtils]: 3: Hoare triple {2276#true} assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; {2276#true} is VALID [2020-07-29 01:35:34,320 INFO L280 TraceCheckUtils]: 4: Hoare triple {2276#true} assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {2276#true} is VALID [2020-07-29 01:35:34,320 INFO L280 TraceCheckUtils]: 5: Hoare triple {2276#true} assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {2276#true} is VALID [2020-07-29 01:35:34,320 INFO L280 TraceCheckUtils]: 6: Hoare triple {2276#true} call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {2276#true} is VALID [2020-07-29 01:35:34,320 INFO L280 TraceCheckUtils]: 7: Hoare triple {2276#true} assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; {2276#true} is VALID [2020-07-29 01:35:34,322 INFO L280 TraceCheckUtils]: 8: Hoare triple {2276#true} call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {2278#(= (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~mem11|)} is VALID [2020-07-29 01:35:34,323 INFO L280 TraceCheckUtils]: 9: Hoare triple {2278#(= (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~mem11|)} assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; {2279#(<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 0)} is VALID [2020-07-29 01:35:34,324 INFO L280 TraceCheckUtils]: 10: Hoare triple {2279#(<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 0)} call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; {2279#(<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 0)} is VALID [2020-07-29 01:35:34,325 INFO L280 TraceCheckUtils]: 11: Hoare triple {2279#(<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 0)} assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; {2280#(not |ULTIMATE.start_test_fun_#t~short6|)} is VALID [2020-07-29 01:35:34,326 INFO L280 TraceCheckUtils]: 12: Hoare triple {2280#(not |ULTIMATE.start_test_fun_#t~short6|)} assume !!test_fun_#t~short6;havoc test_fun_#t~mem4;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {2277#false} is VALID [2020-07-29 01:35:34,326 INFO L280 TraceCheckUtils]: 13: Hoare triple {2277#false} assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; {2277#false} is VALID [2020-07-29 01:35:34,326 INFO L280 TraceCheckUtils]: 14: Hoare triple {2277#false} call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {2277#false} is VALID [2020-07-29 01:35:34,326 INFO L280 TraceCheckUtils]: 15: Hoare triple {2277#false} assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; {2277#false} is VALID [2020-07-29 01:35:34,326 INFO L280 TraceCheckUtils]: 16: Hoare triple {2277#false} call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {2277#false} is VALID [2020-07-29 01:35:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:35:34,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541243262] [2020-07-29 01:35:34,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:34,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:35:34,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314985812] [2020-07-29 01:35:34,328 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:35:34,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:34,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 2 times [2020-07-29 01:35:34,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:34,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683168184] [2020-07-29 01:35:34,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:34,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:34,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:34,336 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:34,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:34,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:35:34,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:35:34,381 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-07-29 01:35:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:34,524 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-29 01:35:34,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:35:34,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:35:34,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:34,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2020-07-29 01:35:34,554 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:34,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2020-07-29 01:35:34,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:35:34,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:35:34,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:35:34,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:34,555 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:34,555 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:34,556 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:34,556 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 01:35:34,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:35:34,556 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:34,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:34,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:35:34 BoogieIcfgContainer [2020-07-29 01:35:34,563 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:35:34,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:35:34,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:35:34,563 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:35:34,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:58" (3/4) ... [2020-07-29 01:35:34,568 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:35:34,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:35:34,570 INFO L168 Benchmark]: Toolchain (without parser) took 37395.98 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 950.8 MB in the beginning and 933.0 MB in the end (delta: 17.8 MB). Peak memory consumption was 365.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:34,570 INFO L168 Benchmark]: CDTParser took 0.28 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:34,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:34,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:34,571 INFO L168 Benchmark]: Boogie Preprocessor took 37.37 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:34,571 INFO L168 Benchmark]: RCFGBuilder took 606.58 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:34,572 INFO L168 Benchmark]: BuchiAutomizer took 36092.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.1 GB in the beginning and 942.3 MB in the end (delta: 129.2 MB). Peak memory consumption was 344.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:34,572 INFO L168 Benchmark]: Witness Printer took 4.97 ms. Allocated memory is still 1.4 GB. Free memory was 942.3 MB in the beginning and 933.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:34,574 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.28 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 586.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.37 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 606.58 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 36092.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.1 GB in the beginning and 942.3 MB in the end (delta: 129.2 MB). Peak memory consumption was 344.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.97 ms. Allocated memory is still 1.4 GB. Free memory was 942.3 MB in the beginning and 933.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function (if aux-(*x_ref > 0) && (*y_ref > 0)-aux then 1 else 0) and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One deterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@125d6b64 and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 36.0s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 28.1s. Construction of modules took 0.5s. Büchi inclusion checks took 6.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 57 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 8/8 HoareTripleCheckerStatistics: 117 SDtfs, 91 SDslu, 102 SDs, 0 SdLazy, 235 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital204 mio100 ax108 hnf99 lsp88 ukn72 mio100 lsp34 div100 bol103 ite100 ukn100 eq184 hnf88 smp97 dnf138 smp89 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 78ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...