./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.05-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.05-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 f1e9ba7e316537618e1819aa49662575d0a5a8e7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:29,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:29,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:29,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:29,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:29,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:29,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:29,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:29,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:29,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:29,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:29,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:29,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:29,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:29,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:29,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:29,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:29,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:29,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:29,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:29,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:29,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:29,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:29,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:29,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:29,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:29,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:29,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:29,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:29,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:29,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:29,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:29,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:29,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:29,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:29,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:29,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:29,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:29,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:29,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:29,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:30,000 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:30,017 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:30,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:30,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:30,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:30,019 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:30,019 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:30,020 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:30,020 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:30,020 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:30,021 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:30,021 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:30,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:30,021 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:30,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:30,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:30,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:30,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:30,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:30,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:30,023 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:30,024 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:30,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:30,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:30,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:30,025 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:30,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:30,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:30,026 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:30,026 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:30,027 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:30,028 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 -> f1e9ba7e316537618e1819aa49662575d0a5a8e7 [2020-07-29 01:34:30,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:30,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:30,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:30,429 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:30,430 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:30,435 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2020-07-29 01:34:30,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd80af482/999f520085014b8f9e15efba9d922e7a/FLAG7812bf5f6 [2020-07-29 01:34:30,980 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:30,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2020-07-29 01:34:30,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd80af482/999f520085014b8f9e15efba9d922e7a/FLAG7812bf5f6 [2020-07-29 01:34:31,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd80af482/999f520085014b8f9e15efba9d922e7a [2020-07-29 01:34:31,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:31,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:31,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:31,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:31,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:31,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:31" (1/1) ... [2020-07-29 01:34:31,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653d06cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:31, skipping insertion in model container [2020-07-29 01:34:31,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:31" (1/1) ... [2020-07-29 01:34:31,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:31,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:31,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:31,844 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:31,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:31,945 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:31,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:31 WrapperNode [2020-07-29 01:34:31,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:31,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:31,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:31,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:31,960 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:31" (1/1) ... [2020-07-29 01:34:31,976 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:31" (1/1) ... [2020-07-29 01:34:32,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:32,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:32,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:32,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:32,012 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:31" (1/1) ... [2020-07-29 01:34:32,012 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:31" (1/1) ... [2020-07-29 01:34:32,015 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:31" (1/1) ... [2020-07-29 01:34:32,016 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:31" (1/1) ... [2020-07-29 01:34:32,026 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:31" (1/1) ... [2020-07-29 01:34:32,035 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:31" (1/1) ... [2020-07-29 01:34:32,037 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:31" (1/1) ... [2020-07-29 01:34:32,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:32,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:32,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:32,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:32,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:31" (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:32,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:32,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:32,493 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:32,493 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:34:32,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:32 BoogieIcfgContainer [2020-07-29 01:34:32,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:32,498 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:32,498 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:32,501 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:32,502 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:32,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:31" (1/3) ... [2020-07-29 01:34:32,504 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56e44047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:32, skipping insertion in model container [2020-07-29 01:34:32,504 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:32,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:31" (2/3) ... [2020-07-29 01:34:32,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56e44047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:32, skipping insertion in model container [2020-07-29 01:34:32,505 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:32,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:32" (3/3) ... [2020-07-29 01:34:32,507 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.05-alloca.i [2020-07-29 01:34:32,554 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:32,555 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:32,555 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:32,555 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:32,556 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:32,556 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:32,556 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:32,556 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:32,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:34:32,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:32,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:32,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:32,595 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:32,595 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:32,596 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:32,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:34:32,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:32,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:32,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:32,599 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:32,599 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:32,607 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;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_~tmp_ref~0.base, test_fun_~tmp_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_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 6#L554-11true [2020-07-29 01:34:32,607 INFO L796 eck$LassoCheckResult]: Loop: 6#L554-11true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 8#L554-1true assume test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 >= 0; 12#L554-3true test_fun_#t~short9 := test_fun_#t~short7; 14#L554-4true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3#L554-6true test_fun_#t~short11 := test_fun_#t~short9; 4#L554-7true assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 5#L554-9true assume !!test_fun_#t~short11;havoc test_fun_#t~mem5;havoc test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~short9;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 6#L554-11true [2020-07-29 01:34:32,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:32,612 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:34:32,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:32,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901529374] [2020-07-29 01:34:32,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:32,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:32,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:32,772 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:32,773 INFO L82 PathProgramCache]: Analyzing trace with hash -334850282, now seen corresponding path program 1 times [2020-07-29 01:34:32,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:32,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044021126] [2020-07-29 01:34:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:32,795 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:32,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:32,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:32,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:32,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1211446548, now seen corresponding path program 1 times [2020-07-29 01:34:32,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:32,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23075571] [2020-07-29 01:34:32,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:32,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:32,918 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:32,929 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:33,204 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2020-07-29 01:34:33,587 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2020-07-29 01:34:33,743 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:33,744 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:33,744 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:33,745 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:33,745 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:33,745 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:33,745 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:33,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:33,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.05-alloca.i_Iteration1_Lasso [2020-07-29 01:34:33,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:33,747 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:33,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:34:33,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:33,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:34,093 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2020-07-29 01:34:34,209 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2020-07-29 01:34:34,213 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:34:34,213 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:34:34,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:34,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:34,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:34:34,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:34,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:35,056 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:35,062 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:35,069 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:34:35,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:35,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:35,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:35,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:35,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:35,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:35,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:35,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:35,125 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:34:35,165 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:34:35,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:35,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:35,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:35,171 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:34:35,203 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:34:35,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:35,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:35,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:35,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 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:34:35,245 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:34:35,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:35,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:35,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 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:34:35,278 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:34:35,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:35,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:35,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:35,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 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:34:35,309 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:34:35,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:35,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:35,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:35,313 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:34:35,344 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:34:35,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:35,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:35,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:35,350 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:34:35,373 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:34:35,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:35,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:35,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:35,382 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:34:35,404 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:34:35,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:35,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:35,412 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) [2020-07-29 01:34:35,436 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:34:35,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:35,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:35,449 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:34:35,487 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:34:35,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:35,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:35,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:35,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 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:34:35,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:35,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:35,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:35,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:35,584 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:34:35,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:35,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:35,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:35,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:35,610 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:34:35,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:35,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:35,630 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:34:35,656 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:34:35,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:35,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:35,671 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:34:35,707 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:34:35,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:35,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:35,720 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:34:35,752 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:34:35,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:35,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:35,761 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:34:35,791 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:34:35,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:35,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:35,798 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:34:35,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:34:35,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:35,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:35,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:35,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:35,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:35,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:35,846 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:35,872 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:34:35,872 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. 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:34:35,893 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:35,903 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:34:35,904 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:35,905 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2020-07-29 01:34:36,000 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2020-07-29 01:34:36,011 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0;" "assume test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 >= 0;" "test_fun_#t~short9 := test_fun_#t~short7;" "assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824;" "test_fun_#t~short11 := test_fun_#t~short9;" "assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10;" "assume !!test_fun_#t~short11;havoc test_fun_#t~mem5;havoc test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~short9;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13;" [2020-07-29 01:34:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:36,036 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:36,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:34:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:36,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:36,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {24#unseeded} is VALID [2020-07-29 01:34:36,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#unseeded} havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;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_~tmp_ref~0.base, test_fun_~tmp_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_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; {94#(and (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) unseeded)} is VALID [2020-07-29 01:34:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:36,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:34:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:36,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:36,194 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:36,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#(and (>= 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_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; {106#(and (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~short7|)) (<= (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_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} is VALID [2020-07-29 01:34:36,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#(and (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~short7|)) (<= (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_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} assume test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 >= 0; {110#(and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} is VALID [2020-07-29 01:34:36,304 INFO L280 TraceCheckUtils]: 2: Hoare triple {110#(and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} test_fun_#t~short9 := test_fun_#t~short7; {110#(and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} is VALID [2020-07-29 01:34:36,305 INFO L280 TraceCheckUtils]: 3: Hoare triple {110#(and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; {110#(and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} is VALID [2020-07-29 01:34:36,306 INFO L280 TraceCheckUtils]: 4: Hoare triple {110#(and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} test_fun_#t~short11 := test_fun_#t~short9; {110#(and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} is VALID [2020-07-29 01:34:36,307 INFO L280 TraceCheckUtils]: 5: Hoare triple {110#(and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; {110#(and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} is VALID [2020-07-29 01:34:36,309 INFO L280 TraceCheckUtils]: 6: Hoare triple {110#(and (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)))} assume !!test_fun_#t~short11;havoc test_fun_#t~mem5;havoc test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~short9;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; {97#(and (= ULTIMATE.start_test_fun_~x_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|) (not (= ULTIMATE.start_test_fun_~tmp_ref~0.base |ULTIMATE.start_test_fun_#t~malloc2.base|)) (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:34:36,309 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:36,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:36,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:36,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:36,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,362 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:34:36,363 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2020-07-29 01:34:36,602 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 4 states. Result 42 states and 57 transitions. Complement of second has 10 states. [2020-07-29 01:34:36,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:36,603 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:36,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:34:36,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:36,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:36,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:36,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:34:36,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:34:36,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:36,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:36,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 57 transitions. [2020-07-29 01:34:36,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:36,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:36,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:36,623 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states. [2020-07-29 01:34:36,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:36,628 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:34:36,628 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:34:36,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:34:36,631 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:36,631 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 57 transitions. cyclomatic complexity: 17 [2020-07-29 01:34:36,633 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:34:36,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:36,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:36,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:36,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:36,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:36,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:36,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:36,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:36,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:36,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:34:36,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:34:36,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:34:36,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:36,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:36,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:36,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:36,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:36,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:36,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:34:36,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:34:36,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:34:36,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:36,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:36,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:36,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:34:36,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:34:36,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:34:36,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:36,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:36,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:36,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:34:36,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:34:36,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:34:36,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:36,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:36,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:36,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:34:36,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:34:36,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:34:36,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:36,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:36,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:34:36,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:36,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:36,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:36,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:36,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:36,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:34:36,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:34:36,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:34:36,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:34:36,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:36,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:36,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:36,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:34:36,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:34:36,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 7 letters. [2020-07-29 01:34:36,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:34:36,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:34:36,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:34:36,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:34:36,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:34:36,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:34:36,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:34:36,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:34:36,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 57 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:34:36,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,659 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:34:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2020-07-29 01:34:36,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:36,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:34:36,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 14 letters. [2020-07-29 01:34:36,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:36,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions. cyclomatic complexity: 17 [2020-07-29 01:34:36,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:36,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 24 states and 33 transitions. [2020-07-29 01:34:36,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:34:36,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:34:36,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2020-07-29 01:34:36,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:36,676 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:34:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2020-07-29 01:34:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-29 01:34:36,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:36,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 33 transitions. Second operand 23 states. [2020-07-29 01:34:36,701 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 33 transitions. Second operand 23 states. [2020-07-29 01:34:36,703 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 23 states. [2020-07-29 01:34:36,705 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:36,708 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2020-07-29 01:34:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2020-07-29 01:34:36,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:36,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:36,710 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states and 33 transitions. [2020-07-29 01:34:36,710 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states and 33 transitions. [2020-07-29 01:34:36,710 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:36,713 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2020-07-29 01:34:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-07-29 01:34:36,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:36,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:36,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:36,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:34:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2020-07-29 01:34:36,717 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2020-07-29 01:34:36,717 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2020-07-29 01:34:36,717 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:36,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2020-07-29 01:34:36,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:36,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:36,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:36,718 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:36,718 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:36,719 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 187#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;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_~tmp_ref~0.base, test_fun_~tmp_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_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 188#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 189#L554-1 [2020-07-29 01:34:36,719 INFO L796 eck$LassoCheckResult]: Loop: 189#L554-1 assume !test_fun_#t~short7; 190#L554-3 test_fun_#t~short9 := test_fun_#t~short7; 197#L554-4 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 183#L554-6 test_fun_#t~short11 := test_fun_#t~short9; 184#L554-7 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 194#L554-9 assume !!test_fun_#t~short11;havoc test_fun_#t~mem5;havoc test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~short9;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 199#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 189#L554-1 [2020-07-29 01:34:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:36,719 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:34:36,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:36,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215826204] [2020-07-29 01:34:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:36,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:36,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:36,753 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:36,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash -74889736, now seen corresponding path program 1 times [2020-07-29 01:34:36,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:36,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490732637] [2020-07-29 01:34:36,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:36,797 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#true} assume !test_fun_#t~short7; {305#(not |ULTIMATE.start_test_fun_#t~short7|)} is VALID [2020-07-29 01:34:36,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {305#(not |ULTIMATE.start_test_fun_#t~short7|)} test_fun_#t~short9 := test_fun_#t~short7; {306#(not |ULTIMATE.start_test_fun_#t~short9|)} is VALID [2020-07-29 01:34:36,799 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#(not |ULTIMATE.start_test_fun_#t~short9|)} assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; {304#false} is VALID [2020-07-29 01:34:36,799 INFO L280 TraceCheckUtils]: 3: Hoare triple {304#false} test_fun_#t~short11 := test_fun_#t~short9; {304#false} is VALID [2020-07-29 01:34:36,799 INFO L280 TraceCheckUtils]: 4: Hoare triple {304#false} assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; {304#false} is VALID [2020-07-29 01:34:36,800 INFO L280 TraceCheckUtils]: 5: Hoare triple {304#false} assume !!test_fun_#t~short11;havoc test_fun_#t~mem5;havoc test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~short9;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; {304#false} is VALID [2020-07-29 01:34:36,800 INFO L280 TraceCheckUtils]: 6: Hoare triple {304#false} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; {304#false} is VALID [2020-07-29 01:34:36,801 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:36,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490732637] [2020-07-29 01:34:36,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:36,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:34:36,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55666478] [2020-07-29 01:34:36,805 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:36,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:36,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:34:36,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:34:36,809 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:34:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:36,894 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2020-07-29 01:34:36,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:34:36,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:36,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:36,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2020-07-29 01:34:36,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:36,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2020-07-29 01:34:36,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:34:36,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:34:36,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2020-07-29 01:34:36,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:36,910 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-29 01:34:36,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2020-07-29 01:34:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2020-07-29 01:34:36,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:36,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 34 transitions. Second operand 23 states. [2020-07-29 01:34:36,913 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 34 transitions. Second operand 23 states. [2020-07-29 01:34:36,913 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 23 states. [2020-07-29 01:34:36,913 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:36,916 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2020-07-29 01:34:36,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-29 01:34:36,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:36,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:36,917 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 26 states and 34 transitions. [2020-07-29 01:34:36,917 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 26 states and 34 transitions. [2020-07-29 01:34:36,917 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:36,920 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2020-07-29 01:34:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-29 01:34:36,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:36,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:36,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:36,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:34:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-07-29 01:34:36,922 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 01:34:36,923 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 01:34:36,923 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:34:36,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:34:36,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:36,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:36,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:36,924 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:36,924 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:36,924 INFO L794 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 339#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;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_~tmp_ref~0.base, test_fun_~tmp_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_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 340#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 341#L554-1 [2020-07-29 01:34:36,925 INFO L796 eck$LassoCheckResult]: Loop: 341#L554-1 assume !test_fun_#t~short7; 342#L554-3 test_fun_#t~short9 := test_fun_#t~short7; 349#L554-4 assume !test_fun_#t~short9; 335#L554-6 test_fun_#t~short11 := test_fun_#t~short9; 336#L554-7 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 346#L554-9 assume !!test_fun_#t~short11;havoc test_fun_#t~mem5;havoc test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~short9;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 351#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 341#L554-1 [2020-07-29 01:34:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:36,925 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2020-07-29 01:34:36,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:36,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699428011] [2020-07-29 01:34:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:36,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:36,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:36,959 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:36,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:36,959 INFO L82 PathProgramCache]: Analyzing trace with hash -73042694, now seen corresponding path program 1 times [2020-07-29 01:34:36,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:36,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840305166] [2020-07-29 01:34:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:36,992 INFO L280 TraceCheckUtils]: 0: Hoare triple {460#true} assume !test_fun_#t~short7; {462#(not |ULTIMATE.start_test_fun_#t~short7|)} is VALID [2020-07-29 01:34:36,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {462#(not |ULTIMATE.start_test_fun_#t~short7|)} test_fun_#t~short9 := test_fun_#t~short7; {463#(not |ULTIMATE.start_test_fun_#t~short9|)} is VALID [2020-07-29 01:34:36,993 INFO L280 TraceCheckUtils]: 2: Hoare triple {463#(not |ULTIMATE.start_test_fun_#t~short9|)} assume !test_fun_#t~short9; {463#(not |ULTIMATE.start_test_fun_#t~short9|)} is VALID [2020-07-29 01:34:36,994 INFO L280 TraceCheckUtils]: 3: Hoare triple {463#(not |ULTIMATE.start_test_fun_#t~short9|)} test_fun_#t~short11 := test_fun_#t~short9; {464#(not |ULTIMATE.start_test_fun_#t~short11|)} is VALID [2020-07-29 01:34:36,995 INFO L280 TraceCheckUtils]: 4: Hoare triple {464#(not |ULTIMATE.start_test_fun_#t~short11|)} assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; {461#false} is VALID [2020-07-29 01:34:36,995 INFO L280 TraceCheckUtils]: 5: Hoare triple {461#false} assume !!test_fun_#t~short11;havoc test_fun_#t~mem5;havoc test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~short9;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; {461#false} is VALID [2020-07-29 01:34:36,995 INFO L280 TraceCheckUtils]: 6: Hoare triple {461#false} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; {461#false} is VALID [2020-07-29 01:34:36,996 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:36,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840305166] [2020-07-29 01:34:36,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:36,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:34:36,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015719886] [2020-07-29 01:34:36,998 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:36,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:36,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:34:36,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:34:36,998 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-07-29 01:34:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:37,123 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-29 01:34:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:34:37,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:37,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:37,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2020-07-29 01:34:37,137 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:37,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2020-07-29 01:34:37,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:34:37,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:34:37,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:34:37,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:37,138 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:37,138 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:37,138 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:37,138 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:34:37,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:34:37,139 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:37,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:37,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:34:37 BoogieIcfgContainer [2020-07-29 01:34:37,146 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:34:37,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:34:37,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:34:37,148 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:34:37,148 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:32" (3/4) ... [2020-07-29 01:34:37,152 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:34:37,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:34:37,154 INFO L168 Benchmark]: Toolchain (without parser) took 5855.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 961.6 MB in the beginning and 814.8 MB in the end (delta: 146.8 MB). Peak memory consumption was 333.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:37,155 INFO L168 Benchmark]: CDTParser took 1.89 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:37,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 645.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -139.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:37,156 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:37,157 INFO L168 Benchmark]: Boogie Preprocessor took 36.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:37,158 INFO L168 Benchmark]: RCFGBuilder took 456.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:37,159 INFO L168 Benchmark]: BuchiAutomizer took 4649.05 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 814.8 MB in the end (delta: 247.1 MB). Peak memory consumption was 322.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:37,159 INFO L168 Benchmark]: Witness Printer took 5.24 ms. Allocated memory is still 1.2 GB. Free memory is still 814.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:37,163 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 1.89 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 645.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -139.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 456.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4649.05 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 814.8 MB in the end (delta: 247.1 MB). Peak memory consumption was 322.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.24 ms. Allocated memory is still 1.2 GB. Free memory is still 814.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 40 SDslu, 39 SDs, 0 SdLazy, 59 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital213 mio100 ax108 hnf100 lsp87 ukn64 mio100 lsp34 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...