./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.11-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.11-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 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:37,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:37,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:37,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:37,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:37,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:37,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:37,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:37,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:37,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:37,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:37,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:37,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:37,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:37,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:37,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:37,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:37,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:37,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:37,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:37,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:37,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:37,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:37,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:37,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:37,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:37,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:37,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:37,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:37,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:37,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:37,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:37,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:37,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:37,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:37,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:37,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:37,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:37,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:37,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:37,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:37,236 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:37,255 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:37,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:37,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:37,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:37,257 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:37,257 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:37,258 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:37,258 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:37,258 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:37,259 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:37,259 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:37,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:37,259 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:37,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:37,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:37,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:37,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:37,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:37,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:37,262 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:37,262 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:37,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:37,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:37,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:37,263 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:37,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:37,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:37,264 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:37,264 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:37,265 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:37,266 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 -> 6d6fa40570ac98fcded670ccb8a913ea07efa9b1 [2020-07-29 01:34:37,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:37,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:37,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:37,610 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:37,612 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:37,613 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2020-07-29 01:34:37,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2ce30d7/4ac80532584f4b2ea66ae9bda9d4a154/FLAGb5197c962 [2020-07-29 01:34:38,236 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:38,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2020-07-29 01:34:38,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2ce30d7/4ac80532584f4b2ea66ae9bda9d4a154/FLAGb5197c962 [2020-07-29 01:34:38,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2ce30d7/4ac80532584f4b2ea66ae9bda9d4a154 [2020-07-29 01:34:38,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:38,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:38,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:38,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:38,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:38,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:38" (1/1) ... [2020-07-29 01:34:38,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72dbb287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:38, skipping insertion in model container [2020-07-29 01:34:38,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:38" (1/1) ... [2020-07-29 01:34:38,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:38,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:38,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:38,978 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:39,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:39,097 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:39,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:39 WrapperNode [2020-07-29 01:34:39,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:39,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:39,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:39,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:39,108 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:39" (1/1) ... [2020-07-29 01:34:39,125 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:39" (1/1) ... [2020-07-29 01:34:39,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:39,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:39,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:39,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:39,166 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:39" (1/1) ... [2020-07-29 01:34:39,167 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:39" (1/1) ... [2020-07-29 01:34:39,171 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:39" (1/1) ... [2020-07-29 01:34:39,171 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:39" (1/1) ... [2020-07-29 01:34:39,179 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:39" (1/1) ... [2020-07-29 01:34:39,184 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:39" (1/1) ... [2020-07-29 01:34:39,186 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:39" (1/1) ... [2020-07-29 01:34:39,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:39,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:39,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:39,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:39,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:39" (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:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:39,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:39,748 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:39,748 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:34:39,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:39 BoogieIcfgContainer [2020-07-29 01:34:39,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:39,754 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:39,755 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:39,758 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:39,760 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:39,760 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:38" (1/3) ... [2020-07-29 01:34:39,761 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29d562ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:39, skipping insertion in model container [2020-07-29 01:34:39,762 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:39,762 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:39" (2/3) ... [2020-07-29 01:34:39,763 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29d562ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:39, skipping insertion in model container [2020-07-29 01:34:39,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:39,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:39" (3/3) ... [2020-07-29 01:34:39,766 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.11-alloca.i [2020-07-29 01:34:39,827 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:39,828 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:39,828 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:39,828 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:39,829 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:39,829 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:39,829 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:39,829 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:39,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:34:39,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:34:39,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:39,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:39,883 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:39,883 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:39,884 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:39,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:34:39,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:34:39,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:39,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:39,889 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:39,890 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:39,898 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 5#L559-2true [2020-07-29 01:34:39,899 INFO L796 eck$LassoCheckResult]: Loop: 5#L559-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 10#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 14#L555-3true test_fun_#t~short13 := test_fun_#t~short8; 16#L555-4true assume test_fun_#t~short13; 6#L555-9true test_fun_#t~short16 := test_fun_#t~short13; 8#L555-10true assume !test_fun_#t~short16; 11#L555-12true assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 7#L556true assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 5#L559-2true [2020-07-29 01:34:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:39,907 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:34:39,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:39,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810448844] [2020-07-29 01:34:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,121 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:40,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1790206705, now seen corresponding path program 1 times [2020-07-29 01:34:40,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:40,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159447448] [2020-07-29 01:34:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:40,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; {24#true} is VALID [2020-07-29 01:34:40,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; {24#true} is VALID [2020-07-29 01:34:40,213 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} test_fun_#t~short13 := test_fun_#t~short8; {24#true} is VALID [2020-07-29 01:34:40,214 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#true} assume test_fun_#t~short13; {26#|ULTIMATE.start_test_fun_#t~short13|} is VALID [2020-07-29 01:34:40,216 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#|ULTIMATE.start_test_fun_#t~short13|} test_fun_#t~short16 := test_fun_#t~short13; {27#|ULTIMATE.start_test_fun_#t~short16|} is VALID [2020-07-29 01:34:40,217 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#|ULTIMATE.start_test_fun_#t~short16|} assume !test_fun_#t~short16; {25#false} is VALID [2020-07-29 01:34:40,217 INFO L280 TraceCheckUtils]: 6: Hoare triple {25#false} assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {25#false} is VALID [2020-07-29 01:34:40,218 INFO L280 TraceCheckUtils]: 7: Hoare triple {25#false} assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; {25#false} is VALID [2020-07-29 01:34:40,221 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:40,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159447448] [2020-07-29 01:34:40,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:40,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:34:40,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702964851] [2020-07-29 01:34:40,229 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:40,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:40,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:34:40,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:34:40,248 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2020-07-29 01:34:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:40,396 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 01:34:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:34:40,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:40,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:40,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-07-29 01:34:40,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:34:40,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2020-07-29 01:34:40,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:34:40,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:34:40,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-07-29 01:34:40,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:40,429 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:34:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-07-29 01:34:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-29 01:34:40,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:40,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand 15 states. [2020-07-29 01:34:40,457 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand 15 states. [2020-07-29 01:34:40,459 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 15 states. [2020-07-29 01:34:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:40,464 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:34:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:34:40,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:40,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:40,467 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states and 22 transitions. [2020-07-29 01:34:40,467 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states and 22 transitions. [2020-07-29 01:34:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:40,470 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:34:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:34:40,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:40,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:40,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:40,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:34:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-07-29 01:34:40,475 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-07-29 01:34:40,475 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-07-29 01:34:40,476 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:40,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2020-07-29 01:34:40,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:40,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:40,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:40,477 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:40,478 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:40,478 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 61#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 53#L559-2 [2020-07-29 01:34:40,478 INFO L796 eck$LassoCheckResult]: Loop: 53#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 54#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 60#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 63#L555-4 assume test_fun_#t~short13; 64#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 58#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 59#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 56#L556 assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; 53#L559-2 [2020-07-29 01:34:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 01:34:40,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:40,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123884224] [2020-07-29 01:34:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:40,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:40,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1790208627, now seen corresponding path program 1 times [2020-07-29 01:34:40,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:40,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365173216] [2020-07-29 01:34:40,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,621 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:40,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1099647153, now seen corresponding path program 1 times [2020-07-29 01:34:40,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:40,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088752597] [2020-07-29 01:34:40,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:40,980 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2020-07-29 01:34:41,507 WARN L193 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2020-07-29 01:34:41,701 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-07-29 01:34:41,717 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:41,718 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:41,718 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:41,719 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:41,719 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:41,719 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,719 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:41,719 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:41,720 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration2_Lasso [2020-07-29 01:34:41,720 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:41,720 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:41,782 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:41,792 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:41,797 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:41,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:41,806 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:41,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:41,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:41,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:41,829 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:41,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:41,838 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:41,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:41,847 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:41,853 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:41,858 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:41,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:41,866 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:41,870 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:41,874 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:41,878 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:41,882 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:41,886 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:41,891 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:41,895 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:41,900 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:41,904 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:41,908 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:41,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:42,340 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2020-07-29 01:34:42,471 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-07-29 01:34:42,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:42,488 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:43,654 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:43,660 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:43,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:43,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,689 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:43,692 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:43,741 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:43,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,745 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:43,748 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:43,779 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:43,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,785 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:43,810 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:43,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,820 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:43,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:43,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,856 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:43,893 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:43,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,897 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:43,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:43,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:43,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:43,936 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:43,972 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:43,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:43,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:43,981 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:44,005 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:44,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,009 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:44,032 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:44,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,063 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:44,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,068 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:44,091 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:44,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,100 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:44,124 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:44,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,128 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:44,151 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:44,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:44,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:44,158 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:44,184 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:44,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,188 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:44,215 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:44,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,219 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:44,243 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:44,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,247 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:44,272 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:44,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,276 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:44,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:44,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,310 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:44,333 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:44,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,363 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:44,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:44,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:44,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:44,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,429 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:44,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,462 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:44,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:44,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:44,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,493 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:44,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,525 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:44,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,568 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:44,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:44,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:44,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:44,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,597 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:44,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:44,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:44,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:44,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:44,672 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:44,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:44,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:44,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:44,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:44,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:44,695 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:44,805 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:34:44,806 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:44,856 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,881 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:34:44,881 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:44,882 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:45,025 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2020-07-29 01:34:45,032 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~short8 := test_fun_#t~mem5 >= 0;" "assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6;" "test_fun_#t~short13 := test_fun_#t~short8;" "assume test_fun_#t~short13;" "test_fun_#t~short16 := test_fun_#t~short13;" "assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0;" "assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19;" [2020-07-29 01:34:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:45,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:45,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:45,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:45,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:45,112 INFO L280 TraceCheckUtils]: 0: Hoare triple {107#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {107#unseeded} is VALID [2020-07-29 01:34:45,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#unseeded} havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {107#unseeded} is VALID [2020-07-29 01:34:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:45,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:34:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:45,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:45,205 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:45,241 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:45,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {110#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; {110#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} is VALID [2020-07-29 01:34:45,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {110#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; {110#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} is VALID [2020-07-29 01:34:45,362 INFO L280 TraceCheckUtils]: 2: Hoare triple {110#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} test_fun_#t~short13 := test_fun_#t~short8; {110#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} is VALID [2020-07-29 01:34:45,362 INFO L280 TraceCheckUtils]: 3: Hoare triple {110#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} assume test_fun_#t~short13; {110#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} is VALID [2020-07-29 01:34:45,363 INFO L280 TraceCheckUtils]: 4: Hoare triple {110#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} test_fun_#t~short16 := test_fun_#t~short13; {110#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} is VALID [2020-07-29 01:34:45,365 INFO L280 TraceCheckUtils]: 5: Hoare triple {110#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; {258#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (or (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (not |ULTIMATE.start_test_fun_#t~short16|)))} is VALID [2020-07-29 01:34:45,367 INFO L280 TraceCheckUtils]: 6: Hoare triple {258#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (or (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (not |ULTIMATE.start_test_fun_#t~short16|)))} assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {262#(and (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem18|) (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem17| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} is VALID [2020-07-29 01:34:45,370 INFO L280 TraceCheckUtils]: 7: Hoare triple {262#(and (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem18|) (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem17| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} assume test_fun_#t~mem17 > test_fun_#t~mem18;havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem19 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem19; {235#(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:45,370 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:45,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:45,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:45,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:45,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,397 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:45,398 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-07-29 01:34:45,695 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 31 states and 45 transitions. Complement of second has 8 states. [2020-07-29 01:34:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:45,696 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:45,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:45,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:45,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:45,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:34:45,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:45,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:45,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:45,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2020-07-29 01:34:45,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:45,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:45,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:45,709 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 21 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:45,720 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 01:34:45,720 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:34:45,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:45,721 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:45,722 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 45 transitions. cyclomatic complexity: 16 [2020-07-29 01:34:45,724 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 01:34:45,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:45,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:45,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:45,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:34:45,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:34:45,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:34:45,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:34:45,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:34:45,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:34:45,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:34:45,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:34:45,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:34:45,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:34:45,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:34:45,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:34:45,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:34:45,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:34:45,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:34:45,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:34:45,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:34:45,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:34:45,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:34:45,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:34:45,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:34:45,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:34:45,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:34:45,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:34:45,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:34:45,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:34:45,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:34:45,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:45,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:45,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 8 letters. [2020-07-29 01:34:45,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 8 letters. [2020-07-29 01:34:45,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 8 letters. [2020-07-29 01:34:45,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:34:45,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:34:45,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:34:45,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:34:45,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:34:45,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:34:45,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:34:45,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:34:45,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:34:45,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:34:45,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:34:45,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:34:45,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:34:45,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:34:45,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:34:45,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 8 letters. [2020-07-29 01:34:45,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 8 letters. [2020-07-29 01:34:45,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 8 letters. [2020-07-29 01:34:45,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:34:45,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:34:45,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:34:45,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:34:45,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:34:45,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:34:45,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:34:45,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:34:45,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:34:45,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:34:45,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:34:45,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:34:45,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:34:45,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:34:45,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:34:45,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:34:45,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:34:45,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:34:45,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:34:45,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:34:45,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:34:45,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:34:45,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:34:45,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:34:45,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:34:45,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:34:45,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:34:45,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:34:45,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:34:45,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:34:45,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:34:45,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:34:45,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:34:45,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:34:45,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:34:45,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:34:45,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:34:45,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:34:45,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:34:45,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:34:45,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:34:45,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:34:45,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:34:45,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:34:45,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:34:45,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,763 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:34:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-29 01:34:45,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:45,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:34:45,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2020-07-29 01:34:45,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:45,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. cyclomatic complexity: 16 [2020-07-29 01:34:45,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:45,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2020-07-29 01:34:45,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:34:45,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:34:45,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2020-07-29 01:34:45,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:45,776 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-29 01:34:45,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2020-07-29 01:34:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-07-29 01:34:45,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:45,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 45 transitions. Second operand 30 states. [2020-07-29 01:34:45,780 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 45 transitions. Second operand 30 states. [2020-07-29 01:34:45,780 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 30 states. [2020-07-29 01:34:45,781 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:45,787 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2020-07-29 01:34:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-29 01:34:45,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:45,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:45,788 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states and 45 transitions. [2020-07-29 01:34:45,788 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states and 45 transitions. [2020-07-29 01:34:45,788 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:45,795 INFO L93 Difference]: Finished difference Result 32 states and 47 transitions. [2020-07-29 01:34:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2020-07-29 01:34:45,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:45,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:45,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:45,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:34:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2020-07-29 01:34:45,801 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-07-29 01:34:45,801 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-07-29 01:34:45,801 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:34:45,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 43 transitions. [2020-07-29 01:34:45,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:45,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:45,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:45,806 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:45,806 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:45,806 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 331#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 332#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 315#L555-1 [2020-07-29 01:34:45,807 INFO L796 eck$LassoCheckResult]: Loop: 315#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 329#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 334#L555-4 assume test_fun_#t~short13; 318#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 319#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 326#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 321#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 322#L559 assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23; 314#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 315#L555-1 [2020-07-29 01:34:45,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:45,807 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:34:45,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:45,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488643811] [2020-07-29 01:34:45,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:45,852 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:45,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:45,887 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash 572463690, now seen corresponding path program 1 times [2020-07-29 01:34:45,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:45,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152937577] [2020-07-29 01:34:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:45,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:45,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:45,944 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:45,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:45,945 INFO L82 PathProgramCache]: Analyzing trace with hash -198955769, now seen corresponding path program 1 times [2020-07-29 01:34:45,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:45,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464404968] [2020-07-29 01:34:45,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:45,969 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:45,993 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:45,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:46,251 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2020-07-29 01:34:46,755 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 88 [2020-07-29 01:34:46,918 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 01:34:46,928 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:46,928 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:46,928 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:46,928 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:46,929 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:46,929 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,929 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:46,929 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:46,929 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration3_Lasso [2020-07-29 01:34:46,929 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:46,929 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:46,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,971 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:46,974 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:46,977 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:46,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,984 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:46,988 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:46,991 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:46,995 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:47,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:47,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:47,946 WARN L193 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-07-29 01:34:48,119 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2020-07-29 01:34:48,132 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:48,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:48,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:48,151 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:48,158 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:48,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:48,165 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:48,170 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:48,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:48,177 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:48,182 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:48,186 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:48,189 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:48,192 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:48,197 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:48,201 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:49,366 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-07-29 01:34:49,517 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-07-29 01:34:49,668 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:49,668 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:49,674 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:49,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:49,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:49,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:49,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:49,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:49,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:49,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:49,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:49,717 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:49,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:49,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:49,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:49,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:49,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:49,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:49,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:49,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:49,744 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:49,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:49,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:49,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:49,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:49,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:49,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:49,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:49,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:49,770 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:49,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:49,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:49,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:49,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:49,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:49,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:49,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:49,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:49,798 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:49,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:49,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:49,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:49,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:49,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:49,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:49,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:49,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:49,826 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:49,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:49,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:49,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:49,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:49,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:49,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:49,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:49,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:49,852 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:49,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:49,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:49,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:49,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:49,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:49,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:49,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:49,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:49,879 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:49,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:49,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:49,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:49,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:49,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:49,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:49,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:49,913 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:49,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:49,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:49,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:49,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:49,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:49,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:49,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:49,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:49,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:49,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:49,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:49,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:49,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:49,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:49,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:49,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:49,970 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:49,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:49,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:49,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:49,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:49,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:49,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:49,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:50,017 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:50,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,062 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:50,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:50,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:50,146 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:50,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,193 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:50,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:50,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:50,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:50,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,266 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:50,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:50,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:50,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:50,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,329 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:50,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,331 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:34:50,331 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:34:50,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,356 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 01:34:50,356 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:34:50,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:50,453 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:34:50,453 INFO L444 ModelExtractionUtils]: 44 out of 56 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:50,478 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,483 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-07-29 01:34:50,483 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:50,483 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2020-07-29 01:34:50,597 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2020-07-29 01:34:50,603 INFO L393 LassoCheck]: Loop: "assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6;" "test_fun_#t~short13 := test_fun_#t~short8;" "assume test_fun_#t~short13;" "test_fun_#t~short16 := test_fun_#t~short13;" "assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0;" "assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;" "call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0;" [2020-07-29 01:34:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:50,611 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:50,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:50,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:50,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:50,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {457#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {457#unseeded} is VALID [2020-07-29 01:34:50,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {457#unseeded} havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {457#unseeded} is VALID [2020-07-29 01:34:50,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {457#unseeded} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; {457#unseeded} is VALID [2020-07-29 01:34:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:50,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:34:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:50,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:50,702 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:50,728 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:51,043 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:51,044 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 66 [2020-07-29 01:34:51,071 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:51,086 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:51,103 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:51,147 INFO L624 ElimStorePlain]: treesize reduction 130, result has 21.7 percent of original size [2020-07-29 01:34:51,152 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:51,153 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2020-07-29 01:35:03,273 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:03,273 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_91|, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.offset]. (let ((.cse2 (select |v_#memory_int_91| ULTIMATE.start_test_fun_~y_ref~0.base))) (let ((.cse1 (select (select |v_#memory_int_91| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (.cse0 (select .cse2 ULTIMATE.start_test_fun_~y_ref~0.offset))) (and (<= 1 (+ .cse0 .cse1)) (<= .cse0 oldRank0) (<= .cse1 .cse0) (= |#memory_int| (store |v_#memory_int_91| ULTIMATE.start_test_fun_~y_ref~0.base (store .cse2 ULTIMATE.start_test_fun_~y_ref~0.offset (+ .cse0 (- 1)))))))) [2020-07-29 01:35:03,274 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.offset]. (let ((.cse2 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (.cse1 (+ .cse2 1))) (and (<= .cse0 .cse1) (<= 0 (+ .cse0 .cse2)) (<= .cse1 oldRank0)))) [2020-07-29 01:35:03,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {460#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; {460#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:35:03,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {460#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} test_fun_#t~short13 := test_fun_#t~short8; {460#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:35:03,330 INFO L280 TraceCheckUtils]: 2: Hoare triple {460#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} assume test_fun_#t~short13; {460#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:35:03,331 INFO L280 TraceCheckUtils]: 3: Hoare triple {460#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} test_fun_#t~short16 := test_fun_#t~short13; {460#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:35:03,333 INFO L280 TraceCheckUtils]: 4: Hoare triple {460#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; {593#(and (or (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (not |ULTIMATE.start_test_fun_#t~short16|)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))} is VALID [2020-07-29 01:35:03,336 INFO L280 TraceCheckUtils]: 5: Hoare triple {593#(and (or (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (not |ULTIMATE.start_test_fun_#t~short16|)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))} assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {597#(and (<= |ULTIMATE.start_test_fun_#t~mem18| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem17|) (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))} is VALID [2020-07-29 01:35:03,340 INFO L280 TraceCheckUtils]: 6: Hoare triple {597#(and (<= |ULTIMATE.start_test_fun_#t~mem18| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem17|) (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))} assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {601#(and (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))} is VALID [2020-07-29 01:35:03,343 INFO L280 TraceCheckUtils]: 7: Hoare triple {601#(and (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))} assume !(test_fun_#t~mem20 == test_fun_#t~mem21);havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem23 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23; {605#(and (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (and (<= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1)) (<= 0 (+ (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) oldRank0))} is VALID [2020-07-29 01:35:03,345 INFO L280 TraceCheckUtils]: 8: Hoare triple {605#(and (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (and (<= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1)) (<= 0 (+ (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 1) oldRank0))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; {570#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:03,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:35:03,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:03,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:03,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,389 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:35:03,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15 Second operand 7 states. [2020-07-29 01:35:03,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 43 transitions. cyclomatic complexity: 15. Second operand 7 states. Result 64 states and 97 transitions. Complement of second has 10 states. [2020-07-29 01:35:03,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:03,815 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:03,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 43 transitions. cyclomatic complexity: 15 [2020-07-29 01:35:03,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:03,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:03,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:35:03,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:03,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:03,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:03,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 97 transitions. [2020-07-29 01:35:03,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:35:03,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:03,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:03,819 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 43 transitions. cyclomatic complexity: 15 [2020-07-29 01:35:03,821 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 01:35:03,821 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:35:03,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:03,823 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:03,823 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 64 states and 97 transitions. cyclomatic complexity: 37 [2020-07-29 01:35:03,825 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 01:35:03,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:03,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:03,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:03,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:03,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:03,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:03,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:03,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:03,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:03,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 64 letters. Loop has 64 letters. [2020-07-29 01:35:03,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 64 letters. Loop has 64 letters. [2020-07-29 01:35:03,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 64 letters. Loop has 64 letters. [2020-07-29 01:35:03,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:03,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:03,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:03,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:03,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:03,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:03,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:03,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:03,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:03,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:03,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:03,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:03,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:03,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:03,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:03,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:03,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:03,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:03,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:03,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:03,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:03,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:03,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:03,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:03,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:03,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:03,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:03,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:03,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:03,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:03,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:03,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:03,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:03,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:03,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:03,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:03,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:03,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:03,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:03,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:03,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:03,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:03,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:03,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:03,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:03,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:03,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:03,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:03,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:03,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:03,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:03,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:03,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:03,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:03,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:03,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:03,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:03,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:03,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:03,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:03,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:03,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:03,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:03,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:03,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:03,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:03,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:35:03,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:35:03,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:35:03,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:03,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:03,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:03,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:03,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:03,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:03,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:03,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:03,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:03,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:03,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:03,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:03,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:03,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:03,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:03,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 43 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:03,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:03,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 97 transitions. cyclomatic complexity: 37 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:03,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,860 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:35:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2020-07-29 01:35:03,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:03,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:35:03,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 3 letters. Loop has 18 letters. [2020-07-29 01:35:03,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:03,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 97 transitions. cyclomatic complexity: 37 [2020-07-29 01:35:03,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:35:03,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 97 transitions. [2020-07-29 01:35:03,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:35:03,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 01:35:03,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 97 transitions. [2020-07-29 01:35:03,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:03,871 INFO L688 BuchiCegarLoop]: Abstraction has 64 states and 97 transitions. [2020-07-29 01:35:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 97 transitions. [2020-07-29 01:35:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2020-07-29 01:35:03,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:03,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states and 97 transitions. Second operand 62 states. [2020-07-29 01:35:03,876 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states and 97 transitions. Second operand 62 states. [2020-07-29 01:35:03,876 INFO L87 Difference]: Start difference. First operand 64 states and 97 transitions. Second operand 62 states. [2020-07-29 01:35:03,876 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:03,881 INFO L93 Difference]: Finished difference Result 67 states and 103 transitions. [2020-07-29 01:35:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2020-07-29 01:35:03,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:03,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:03,882 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states and 97 transitions. [2020-07-29 01:35:03,882 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states and 97 transitions. [2020-07-29 01:35:03,882 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:03,887 INFO L93 Difference]: Finished difference Result 73 states and 112 transitions. [2020-07-29 01:35:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2020-07-29 01:35:03,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:03,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:03,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:03,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-29 01:35:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2020-07-29 01:35:03,891 INFO L711 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2020-07-29 01:35:03,892 INFO L591 BuchiCegarLoop]: Abstraction has 62 states and 94 transitions. [2020-07-29 01:35:03,892 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:35:03,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 94 transitions. [2020-07-29 01:35:03,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:35:03,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:03,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:03,893 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:35:03,893 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:03,894 INFO L794 eck$LassoCheckResult]: Stem: 714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 712#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 713#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 751#L555-1 assume !test_fun_#t~short8; 715#L555-3 [2020-07-29 01:35:03,894 INFO L796 eck$LassoCheckResult]: Loop: 715#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 716#L555-4 assume test_fun_#t~short13; 718#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 706#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 707#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 701#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 702#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 694#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 695#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 715#L555-3 [2020-07-29 01:35:03,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:03,894 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2020-07-29 01:35:03,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:03,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158843369] [2020-07-29 01:35:03,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:03,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:03,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:03,923 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 1 times [2020-07-29 01:35:03,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:03,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128508098] [2020-07-29 01:35:03,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:03,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:03,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:03,957 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:03,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:03,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2029276831, now seen corresponding path program 1 times [2020-07-29 01:35:03,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:03,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577779414] [2020-07-29 01:35:03,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:04,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {951#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {951#true} is VALID [2020-07-29 01:35:04,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {951#true} havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {951#true} is VALID [2020-07-29 01:35:04,005 INFO L280 TraceCheckUtils]: 2: Hoare triple {951#true} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; {951#true} is VALID [2020-07-29 01:35:04,006 INFO L280 TraceCheckUtils]: 3: Hoare triple {951#true} assume !test_fun_#t~short8; {953#(not |ULTIMATE.start_test_fun_#t~short8|)} is VALID [2020-07-29 01:35:04,007 INFO L280 TraceCheckUtils]: 4: Hoare triple {953#(not |ULTIMATE.start_test_fun_#t~short8|)} test_fun_#t~short13 := test_fun_#t~short8; {954#(not |ULTIMATE.start_test_fun_#t~short13|)} is VALID [2020-07-29 01:35:04,008 INFO L280 TraceCheckUtils]: 5: Hoare triple {954#(not |ULTIMATE.start_test_fun_#t~short13|)} assume test_fun_#t~short13; {952#false} is VALID [2020-07-29 01:35:04,008 INFO L280 TraceCheckUtils]: 6: Hoare triple {952#false} test_fun_#t~short16 := test_fun_#t~short13; {952#false} is VALID [2020-07-29 01:35:04,008 INFO L280 TraceCheckUtils]: 7: Hoare triple {952#false} assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; {952#false} is VALID [2020-07-29 01:35:04,009 INFO L280 TraceCheckUtils]: 8: Hoare triple {952#false} assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {952#false} is VALID [2020-07-29 01:35:04,009 INFO L280 TraceCheckUtils]: 9: Hoare triple {952#false} assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {952#false} is VALID [2020-07-29 01:35:04,009 INFO L280 TraceCheckUtils]: 10: Hoare triple {952#false} assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; {952#false} is VALID [2020-07-29 01:35:04,009 INFO L280 TraceCheckUtils]: 11: Hoare triple {952#false} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; {952#false} is VALID [2020-07-29 01:35:04,010 INFO L280 TraceCheckUtils]: 12: Hoare triple {952#false} assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; {952#false} is VALID [2020-07-29 01:35:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:04,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577779414] [2020-07-29 01:35:04,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:04,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:35:04,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667190376] [2020-07-29 01:35:04,292 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2020-07-29 01:35:04,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:04,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:35:04,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:35:04,406 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. cyclomatic complexity: 36 Second operand 4 states. [2020-07-29 01:35:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:04,538 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2020-07-29 01:35:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:35:04,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:04,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:04,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 130 transitions. [2020-07-29 01:35:04,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-07-29 01:35:04,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 130 transitions. [2020-07-29 01:35:04,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-07-29 01:35:04,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-07-29 01:35:04,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2020-07-29 01:35:04,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:04,582 INFO L688 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2020-07-29 01:35:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2020-07-29 01:35:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2020-07-29 01:35:04,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:04,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states and 130 transitions. Second operand 70 states. [2020-07-29 01:35:04,588 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states and 130 transitions. Second operand 70 states. [2020-07-29 01:35:04,588 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand 70 states. [2020-07-29 01:35:04,589 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:04,593 INFO L93 Difference]: Finished difference Result 93 states and 136 transitions. [2020-07-29 01:35:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2020-07-29 01:35:04,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:04,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:04,595 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 90 states and 130 transitions. [2020-07-29 01:35:04,595 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 90 states and 130 transitions. [2020-07-29 01:35:04,595 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:04,601 INFO L93 Difference]: Finished difference Result 93 states and 136 transitions. [2020-07-29 01:35:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2020-07-29 01:35:04,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:04,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:04,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:04,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-29 01:35:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2020-07-29 01:35:04,605 INFO L711 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2020-07-29 01:35:04,605 INFO L591 BuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2020-07-29 01:35:04,605 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:35:04,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 102 transitions. [2020-07-29 01:35:04,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-07-29 01:35:04,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:04,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:04,607 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:35:04,607 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:04,607 INFO L794 eck$LassoCheckResult]: Stem: 1073#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1071#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1072#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1103#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 1074#L555-3 [2020-07-29 01:35:04,607 INFO L796 eck$LassoCheckResult]: Loop: 1074#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1075#L555-4 assume test_fun_#t~short13; 1055#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1056#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 1062#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1058#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1059#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1051#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1052#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; 1074#L555-3 [2020-07-29 01:35:04,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:04,608 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2020-07-29 01:35:04,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:04,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789192253] [2020-07-29 01:35:04,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,632 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:04,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:04,637 INFO L82 PathProgramCache]: Analyzing trace with hash -162891098, now seen corresponding path program 2 times [2020-07-29 01:35:04,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:04,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609387914] [2020-07-29 01:35:04,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,663 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1872663455, now seen corresponding path program 1 times [2020-07-29 01:35:04,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:04,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996721071] [2020-07-29 01:35:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,685 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,725 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:05,036 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2020-07-29 01:35:05,587 WARN L193 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 98 [2020-07-29 01:35:05,801 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-07-29 01:35:05,805 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:05,805 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:05,805 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:05,805 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:05,805 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:05,805 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:05,806 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:05,806 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:05,806 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.11-alloca.i_Iteration5_Lasso [2020-07-29 01:35:05,806 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:05,806 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:05,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:05,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:05,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:06,989 WARN L193 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2020-07-29 01:35:07,205 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-07-29 01:35:07,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,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:35:07,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:35:07,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:07,894 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-07-29 01:35:08,685 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-07-29 01:35:08,968 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-07-29 01:35:09,299 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:09,299 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:09,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:09,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:09,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:09,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:09,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:09,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:09,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:09,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:09,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:09,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:09,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:09,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:09,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:09,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:09,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:09,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:09,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:09,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:09,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:09,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:09,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:09,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:09,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:09,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:09,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:09,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:09,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:09,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:09,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:09,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:09,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:09,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:09,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:09,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:09,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:09,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:09,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:09,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:09,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:09,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:09,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:09,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:09,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:09,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:09,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:09,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:09,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:09,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:09,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:09,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:09,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:09,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:09,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:09,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:09,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:09,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:09,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:09,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:09,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:09,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:09,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:09,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:09,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:09,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:09,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:09,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:09,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:09,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:09,553 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:35:09,553 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:35:09,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:09,580 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 01:35:09,580 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:35:09,668 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:09,711 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:35:09,711 INFO L444 ModelExtractionUtils]: 58 out of 66 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:09,714 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:09,718 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-07-29 01:35:09,718 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:09,718 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2020-07-29 01:35:09,838 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2020-07-29 01:35:09,843 INFO L393 LassoCheck]: Loop: "test_fun_#t~short13 := test_fun_#t~short8;" "assume test_fun_#t~short13;" "test_fun_#t~short16 := test_fun_#t~short13;" "assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0;" "assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22;" "call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0;" "assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6;" [2020-07-29 01:35:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,854 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:09,910 INFO L280 TraceCheckUtils]: 0: Hoare triple {1371#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1371#unseeded} is VALID [2020-07-29 01:35:09,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {1371#unseeded} havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {1371#unseeded} is VALID [2020-07-29 01:35:09,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {1371#unseeded} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; {1371#unseeded} is VALID [2020-07-29 01:35:09,912 INFO L280 TraceCheckUtils]: 3: Hoare triple {1371#unseeded} assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; {1371#unseeded} is VALID [2020-07-29 01:35:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:35:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:10,022 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:10,061 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:10,355 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:10,356 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 66 [2020-07-29 01:35:10,401 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:35:10,412 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:35:10,433 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:10,488 INFO L624 ElimStorePlain]: treesize reduction 130, result has 21.7 percent of original size [2020-07-29 01:35:10,492 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-29 01:35:10,492 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2020-07-29 01:35:22,586 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:22,587 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_130|, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~y_ref~0.offset]. (let ((.cse1 (select |v_#memory_int_130| ULTIMATE.start_test_fun_~x_ref~0.base))) (let ((.cse2 (select (select |v_#memory_int_130| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (.cse0 (select .cse1 ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= .cse0 oldRank0) (= (store |v_#memory_int_130| ULTIMATE.start_test_fun_~x_ref~0.base (store .cse1 ULTIMATE.start_test_fun_~x_ref~0.offset (+ .cse0 (- 1)))) |#memory_int|) (<= 1 (+ .cse0 .cse2)) (<= .cse2 .cse0)))) [2020-07-29 01:35:22,587 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~y_ref~0.offset]. (let ((.cse2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (.cse1 (+ .cse2 1))) (and (<= .cse0 .cse1) (<= 0 (+ .cse2 .cse0)) (<= .cse1 oldRank0)))) [2020-07-29 01:35:22,656 INFO L280 TraceCheckUtils]: 0: Hoare triple {1374#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} test_fun_#t~short13 := test_fun_#t~short8; {1374#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} is VALID [2020-07-29 01:35:22,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {1374#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} assume test_fun_#t~short13; {1374#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} is VALID [2020-07-29 01:35:22,658 INFO L280 TraceCheckUtils]: 2: Hoare triple {1374#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} test_fun_#t~short16 := test_fun_#t~short13; {1374#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} is VALID [2020-07-29 01:35:22,659 INFO L280 TraceCheckUtils]: 3: Hoare triple {1374#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))} assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; {1507#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (or (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (not |ULTIMATE.start_test_fun_#t~short16|)))} is VALID [2020-07-29 01:35:22,661 INFO L280 TraceCheckUtils]: 4: Hoare triple {1507#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (or (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (not |ULTIMATE.start_test_fun_#t~short16|)))} assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {1511#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))} is VALID [2020-07-29 01:35:22,667 INFO L280 TraceCheckUtils]: 5: Hoare triple {1511#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))} assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {1515#(and (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem21|) (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem20| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} is VALID [2020-07-29 01:35:22,669 INFO L280 TraceCheckUtils]: 6: Hoare triple {1515#(and (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem21|) (<= 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem20| (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)))} assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; {1519#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1)) (<= 0 (+ (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))))} is VALID [2020-07-29 01:35:22,671 INFO L280 TraceCheckUtils]: 7: Hoare triple {1519#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1)) (<= 0 (+ (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; {1519#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1)) (<= 0 (+ (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))))} is VALID [2020-07-29 01:35:22,674 INFO L280 TraceCheckUtils]: 8: Hoare triple {1519#(and (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1) oldRank0) (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 1)) (<= 0 (+ (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))))))} assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 2147483647 - test_fun_#t~mem6; {1484#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:22,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:35:22,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:22,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:22,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:22,709 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:35:22,710 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36 Second operand 7 states. [2020-07-29 01:35:23,127 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 102 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 204 states and 297 transitions. Complement of second has 10 states. [2020-07-29 01:35:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:23,127 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:23,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 102 transitions. cyclomatic complexity: 36 [2020-07-29 01:35:23,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:23,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:23,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:35:23,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:23,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:23,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:23,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 297 transitions. [2020-07-29 01:35:23,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:35:23,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:23,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:23,135 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 70 states and 102 transitions. cyclomatic complexity: 36 [2020-07-29 01:35:23,144 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2020-07-29 01:35:23,144 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:35:23,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:23,147 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:23,147 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 204 states and 297 transitions. cyclomatic complexity: 105 [2020-07-29 01:35:23,148 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2020-07-29 01:35:23,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:23,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:23,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:23,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:23,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:23,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:23,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:35:23,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:35:23,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:35:23,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 204 letters. Loop has 204 letters. [2020-07-29 01:35:23,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 204 letters. Loop has 204 letters. [2020-07-29 01:35:23,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 204 letters. Loop has 204 letters. [2020-07-29 01:35:23,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 70 letters. Loop has 70 letters. [2020-07-29 01:35:23,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 70 letters. Loop has 70 letters. [2020-07-29 01:35:23,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 70 letters. Loop has 70 letters. [2020-07-29 01:35:23,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:23,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:23,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:23,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:23,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:23,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:23,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:23,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:23,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:23,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:23,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:23,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:23,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:23,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:23,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:23,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:23,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:23,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:23,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:23,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:23,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:23,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:35:23,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:35:23,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:35:23,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:23,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:23,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:23,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:23,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:23,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:23,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:23,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:23,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:23,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:23,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:23,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:23,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:23,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:23,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:23,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:23,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:23,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:23,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:35:23,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:35:23,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:35:23,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:23,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:23,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:23,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:23,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:23,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:23,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:35:23,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:35:23,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:35:23,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:35:23,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:35:23,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:35:23,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:23,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:23,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:23,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:35:23,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:35:23,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 5 letters. Loop has 11 letters. [2020-07-29 01:35:23,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:35:23,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:35:23,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 4 letters. Loop has 11 letters. [2020-07-29 01:35:23,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:23,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:23,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:23,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:23,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:23,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:23,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:35:23,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:35:23,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:35:23,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 11 letters. [2020-07-29 01:35:23,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 11 letters. [2020-07-29 01:35:23,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 12 letters. Loop has 11 letters. [2020-07-29 01:35:23,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:23,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:23,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:23,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 70 states and 102 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 11 letters. [2020-07-29 01:35:23,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 11 letters. [2020-07-29 01:35:23,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 204 states and 297 transitions. cyclomatic complexity: 105 Stem has 10 letters. Loop has 11 letters. [2020-07-29 01:35:23,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,186 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:35:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-29 01:35:23,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:23,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:35:23,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 4 letters. Loop has 18 letters. [2020-07-29 01:35:23,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:23,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 297 transitions. cyclomatic complexity: 105 [2020-07-29 01:35:23,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:35:23,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 54 states and 73 transitions. [2020-07-29 01:35:23,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:35:23,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:35:23,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 73 transitions. [2020-07-29 01:35:23,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:23,210 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2020-07-29 01:35:23,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 73 transitions. [2020-07-29 01:35:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-29 01:35:23,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:23,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states and 73 transitions. Second operand 54 states. [2020-07-29 01:35:23,221 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states and 73 transitions. Second operand 54 states. [2020-07-29 01:35:23,221 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand 54 states. [2020-07-29 01:35:23,221 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:23,225 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2020-07-29 01:35:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2020-07-29 01:35:23,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:23,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:23,226 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states and 73 transitions. [2020-07-29 01:35:23,226 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states and 73 transitions. [2020-07-29 01:35:23,226 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:23,232 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2020-07-29 01:35:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2020-07-29 01:35:23,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:23,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:23,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:23,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:35:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2020-07-29 01:35:23,240 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2020-07-29 01:35:23,240 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2020-07-29 01:35:23,240 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:35:23,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. [2020-07-29 01:35:23,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:35:23,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:23,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:23,241 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:35:23,241 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:23,241 INFO L794 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1769#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1770#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1798#L555-1 assume !test_fun_#t~short8; 1772#L555-3 [2020-07-29 01:35:23,242 INFO L796 eck$LassoCheckResult]: Loop: 1772#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 1773#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 1776#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 1746#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 1747#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 1754#L555-10 assume !test_fun_#t~short16; 1761#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1756#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1757#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 1750#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 1751#L555-1 assume !test_fun_#t~short8; 1772#L555-3 [2020-07-29 01:35:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:23,242 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2020-07-29 01:35:23,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:23,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733243544] [2020-07-29 01:35:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:23,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:23,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:23,279 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:23,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1675651104, now seen corresponding path program 1 times [2020-07-29 01:35:23,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:23,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346103489] [2020-07-29 01:35:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:23,315 INFO L280 TraceCheckUtils]: 0: Hoare triple {1965#true} test_fun_#t~short13 := test_fun_#t~short8; {1965#true} is VALID [2020-07-29 01:35:23,316 INFO L280 TraceCheckUtils]: 1: Hoare triple {1965#true} assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; {1965#true} is VALID [2020-07-29 01:35:23,316 INFO L280 TraceCheckUtils]: 2: Hoare triple {1965#true} assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; {1965#true} is VALID [2020-07-29 01:35:23,316 INFO L280 TraceCheckUtils]: 3: Hoare triple {1965#true} test_fun_#t~short13 := test_fun_#t~short12; {1965#true} is VALID [2020-07-29 01:35:23,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {1965#true} test_fun_#t~short16 := test_fun_#t~short13; {1965#true} is VALID [2020-07-29 01:35:23,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {1965#true} assume !test_fun_#t~short16; {1967#(not |ULTIMATE.start_test_fun_#t~short16|)} is VALID [2020-07-29 01:35:23,320 INFO L280 TraceCheckUtils]: 6: Hoare triple {1967#(not |ULTIMATE.start_test_fun_#t~short16|)} assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {1966#false} is VALID [2020-07-29 01:35:23,320 INFO L280 TraceCheckUtils]: 7: Hoare triple {1966#false} assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {1966#false} is VALID [2020-07-29 01:35:23,320 INFO L280 TraceCheckUtils]: 8: Hoare triple {1966#false} assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; {1966#false} is VALID [2020-07-29 01:35:23,321 INFO L280 TraceCheckUtils]: 9: Hoare triple {1966#false} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; {1966#false} is VALID [2020-07-29 01:35:23,321 INFO L280 TraceCheckUtils]: 10: Hoare triple {1966#false} assume !test_fun_#t~short8; {1966#false} is VALID [2020-07-29 01:35:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:23,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346103489] [2020-07-29 01:35:23,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:23,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:35:23,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564786796] [2020-07-29 01:35:23,323 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:35:23,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:23,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:35:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:35:23,323 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-07-29 01:35:23,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:23,403 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-29 01:35:23,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:35:23,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:23,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:23,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2020-07-29 01:35:23,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:35:23,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 54 states and 69 transitions. [2020-07-29 01:35:23,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:35:23,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:35:23,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 69 transitions. [2020-07-29 01:35:23,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:23,439 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-29 01:35:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 69 transitions. [2020-07-29 01:35:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-29 01:35:23,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:23,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states and 69 transitions. Second operand 54 states. [2020-07-29 01:35:23,442 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states and 69 transitions. Second operand 54 states. [2020-07-29 01:35:23,442 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 54 states. [2020-07-29 01:35:23,443 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:23,445 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2020-07-29 01:35:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2020-07-29 01:35:23,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:23,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:23,446 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states and 69 transitions. [2020-07-29 01:35:23,446 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states and 69 transitions. [2020-07-29 01:35:23,447 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:23,448 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2020-07-29 01:35:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2020-07-29 01:35:23,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:23,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:23,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:23,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:35:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-07-29 01:35:23,451 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-29 01:35:23,452 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-29 01:35:23,452 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:35:23,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 69 transitions. [2020-07-29 01:35:23,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:35:23,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:23,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:23,453 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:35:23,453 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:23,454 INFO L794 eck$LassoCheckResult]: Stem: 2051#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2050#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 2030#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 2031#L555-1 assume !test_fun_#t~short8; 2052#L555-3 [2020-07-29 01:35:23,454 INFO L796 eck$LassoCheckResult]: Loop: 2052#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 2053#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 2056#L555-6 assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; 2026#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 2027#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 2035#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 2042#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2037#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2038#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 2059#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 2062#L555-1 assume !test_fun_#t~short8; 2052#L555-3 [2020-07-29 01:35:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2020-07-29 01:35:23,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:23,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218602420] [2020-07-29 01:35:23,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:23,464 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:23,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:23,476 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:23,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1732909406, now seen corresponding path program 1 times [2020-07-29 01:35:23,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:23,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046813035] [2020-07-29 01:35:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:23,621 INFO L280 TraceCheckUtils]: 0: Hoare triple {2245#true} test_fun_#t~short13 := test_fun_#t~short8; {2245#true} is VALID [2020-07-29 01:35:23,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {2245#true} assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; {2247#(or (not |ULTIMATE.start_test_fun_#t~short12|) (<= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 2) 0))} is VALID [2020-07-29 01:35:23,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {2247#(or (not |ULTIMATE.start_test_fun_#t~short12|) (<= (+ (* 2 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) 2) 0))} assume test_fun_#t~short12;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem11 > -2147483648 - test_fun_#t~mem10; {2248#(or (not (= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 2) 0))} is VALID [2020-07-29 01:35:23,628 INFO L280 TraceCheckUtils]: 3: Hoare triple {2248#(or (not (= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 2) 0))} test_fun_#t~short13 := test_fun_#t~short12; {2248#(or (not (= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 2) 0))} is VALID [2020-07-29 01:35:23,629 INFO L280 TraceCheckUtils]: 4: Hoare triple {2248#(or (not (= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 2) 0))} test_fun_#t~short16 := test_fun_#t~short13; {2248#(or (not (= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 2) 0))} is VALID [2020-07-29 01:35:23,631 INFO L280 TraceCheckUtils]: 5: Hoare triple {2248#(or (not (= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (<= (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) 2) 0))} assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; {2249#(or (not (= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (not |ULTIMATE.start_test_fun_#t~short16|))} is VALID [2020-07-29 01:35:23,633 INFO L280 TraceCheckUtils]: 6: Hoare triple {2249#(or (not (= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (not |ULTIMATE.start_test_fun_#t~short16|))} assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {2250#(not (= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:35:23,635 INFO L280 TraceCheckUtils]: 7: Hoare triple {2250#(not (= (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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {2251#(not (= |ULTIMATE.start_test_fun_#t~mem21| |ULTIMATE.start_test_fun_#t~mem20|))} is VALID [2020-07-29 01:35:23,636 INFO L280 TraceCheckUtils]: 8: Hoare triple {2251#(not (= |ULTIMATE.start_test_fun_#t~mem21| |ULTIMATE.start_test_fun_#t~mem20|))} assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; {2246#false} is VALID [2020-07-29 01:35:23,636 INFO L280 TraceCheckUtils]: 9: Hoare triple {2246#false} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; {2246#false} is VALID [2020-07-29 01:35:23,637 INFO L280 TraceCheckUtils]: 10: Hoare triple {2246#false} assume !test_fun_#t~short8; {2246#false} is VALID [2020-07-29 01:35:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:23,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046813035] [2020-07-29 01:35:23,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:23,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:35:23,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481448250] [2020-07-29 01:35:23,639 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:35:23,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:23,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:35:23,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:35:23,640 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. cyclomatic complexity: 19 Second operand 7 states. [2020-07-29 01:35:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:24,141 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2020-07-29 01:35:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:35:24,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:35:24,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:24,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 93 transitions. [2020-07-29 01:35:24,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:35:24,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 86 transitions. [2020-07-29 01:35:24,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:35:24,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:35:24,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 86 transitions. [2020-07-29 01:35:24,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:24,179 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2020-07-29 01:35:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 86 transitions. [2020-07-29 01:35:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-07-29 01:35:24,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:24,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states and 86 transitions. Second operand 71 states. [2020-07-29 01:35:24,187 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states and 86 transitions. Second operand 71 states. [2020-07-29 01:35:24,187 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand 71 states. [2020-07-29 01:35:24,187 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:24,189 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2020-07-29 01:35:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2020-07-29 01:35:24,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:24,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:24,190 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states and 86 transitions. [2020-07-29 01:35:24,190 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states and 86 transitions. [2020-07-29 01:35:24,191 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:24,194 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2020-07-29 01:35:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2020-07-29 01:35:24,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:24,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:24,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:24,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-29 01:35:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2020-07-29 01:35:24,197 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2020-07-29 01:35:24,197 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2020-07-29 01:35:24,198 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:35:24,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 86 transitions. [2020-07-29 01:35:24,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:35:24,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:24,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:24,200 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:35:24,200 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:24,200 INFO L794 eck$LassoCheckResult]: Stem: 2356#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2354#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~nondet26, main_#t~ret27;test_fun_#in~x, test_fun_#in~y := main_#t~nondet25, main_#t~nondet26;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem17, test_fun_#t~mem18, test_fun_#t~mem19, test_fun_#t~mem20, test_fun_#t~mem21, test_fun_#t~mem22, test_fun_#t~mem23, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem10, test_fun_#t~short12, test_fun_#t~short13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~short16, test_fun_#t~mem24, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 2355#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 2391#L555-1 assume !test_fun_#t~short8; 2357#L555-3 [2020-07-29 01:35:24,200 INFO L796 eck$LassoCheckResult]: Loop: 2357#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 2358#L555-4 assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; 2360#L555-6 assume !test_fun_#t~short12; 2336#L555-8 test_fun_#t~short13 := test_fun_#t~short12; 2337#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 2344#L555-10 assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; 2350#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2346#L556 assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2347#L559 assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; 2340#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; 2341#L555-1 assume !test_fun_#t~short8; 2357#L555-3 [2020-07-29 01:35:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:24,201 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2020-07-29 01:35:24,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:24,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257528785] [2020-07-29 01:35:24,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:24,220 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:24,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:24,245 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:24,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1052851036, now seen corresponding path program 1 times [2020-07-29 01:35:24,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:24,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689347257] [2020-07-29 01:35:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:24,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {2618#true} test_fun_#t~short13 := test_fun_#t~short8; {2618#true} is VALID [2020-07-29 01:35:24,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {2618#true} assume !test_fun_#t~short13;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short12 := test_fun_#t~mem9 < 0; {2618#true} is VALID [2020-07-29 01:35:24,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {2618#true} assume !test_fun_#t~short12; {2620#(not |ULTIMATE.start_test_fun_#t~short12|)} is VALID [2020-07-29 01:35:24,296 INFO L280 TraceCheckUtils]: 3: Hoare triple {2620#(not |ULTIMATE.start_test_fun_#t~short12|)} test_fun_#t~short13 := test_fun_#t~short12; {2621#(not |ULTIMATE.start_test_fun_#t~short13|)} is VALID [2020-07-29 01:35:24,298 INFO L280 TraceCheckUtils]: 4: Hoare triple {2621#(not |ULTIMATE.start_test_fun_#t~short13|)} test_fun_#t~short16 := test_fun_#t~short13; {2622#(not |ULTIMATE.start_test_fun_#t~short16|)} is VALID [2020-07-29 01:35:24,299 INFO L280 TraceCheckUtils]: 5: Hoare triple {2622#(not |ULTIMATE.start_test_fun_#t~short16|)} assume test_fun_#t~short16;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short16 := test_fun_#t~mem14 + test_fun_#t~mem15 > 0; {2619#false} is VALID [2020-07-29 01:35:24,299 INFO L280 TraceCheckUtils]: 6: Hoare triple {2619#false} assume !!test_fun_#t~short16;havoc test_fun_#t~mem10;havoc test_fun_#t~short12;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~mem5;havoc test_fun_#t~short16;havoc test_fun_#t~mem9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem11;havoc test_fun_#t~mem14;havoc test_fun_#t~short8;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem18 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {2619#false} is VALID [2020-07-29 01:35:24,299 INFO L280 TraceCheckUtils]: 7: Hoare triple {2619#false} assume !(test_fun_#t~mem17 > test_fun_#t~mem18);havoc test_fun_#t~mem18;havoc test_fun_#t~mem17;call test_fun_#t~mem20 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem21 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {2619#false} is VALID [2020-07-29 01:35:24,300 INFO L280 TraceCheckUtils]: 8: Hoare triple {2619#false} assume test_fun_#t~mem20 == test_fun_#t~mem21;havoc test_fun_#t~mem20;havoc test_fun_#t~mem21;call test_fun_#t~mem22 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem22 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem22; {2619#false} is VALID [2020-07-29 01:35:24,300 INFO L280 TraceCheckUtils]: 9: Hoare triple {2619#false} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 >= 0; {2619#false} is VALID [2020-07-29 01:35:24,300 INFO L280 TraceCheckUtils]: 10: Hoare triple {2619#false} assume !test_fun_#t~short8; {2619#false} is VALID [2020-07-29 01:35:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:24,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689347257] [2020-07-29 01:35:24,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:24,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:35:24,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571706770] [2020-07-29 01:35:24,302 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:35:24,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:24,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:35:24,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:35:24,303 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. cyclomatic complexity: 19 Second operand 5 states. [2020-07-29 01:35:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:24,468 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-29 01:35:24,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:35:24,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:35:24,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:24,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2020-07-29 01:35:24,496 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:24,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2020-07-29 01:35:24,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:35:24,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:35:24,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:35:24,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:24,497 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:24,497 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:24,497 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:24,497 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:35:24,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:35:24,497 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:24,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:24,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:35:24 BoogieIcfgContainer [2020-07-29 01:35:24,505 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:35:24,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:35:24,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:35:24,506 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:35:24,507 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:39" (3/4) ... [2020-07-29 01:35:24,511 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:35:24,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:35:24,513 INFO L168 Benchmark]: Toolchain (without parser) took 45975.51 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 465.0 MB). Free memory was 958.9 MB in the beginning and 1.2 GB in the end (delta: -238.0 MB). Peak memory consumption was 227.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,514 INFO L168 Benchmark]: CDTParser took 0.22 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:35:24,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,515 INFO L168 Benchmark]: Boogie Preprocessor took 33.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:24,516 INFO L168 Benchmark]: RCFGBuilder took 562.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,517 INFO L168 Benchmark]: BuchiAutomizer took 44751.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 318.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.8 MB). Peak memory consumption was 207.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:24,517 INFO L168 Benchmark]: Witness Printer took 5.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:24,519 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 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 556.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 562.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 44751.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 318.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.8 MB). Peak memory consumption was 207.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (5 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.6s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 15.8s. Construction of modules took 0.5s. Büchi inclusion checks took 27.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 71 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 132 SDtfs, 84 SDslu, 179 SDs, 0 SdLazy, 214 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital303 mio100 ax105 hnf99 lsp95 ukn82 mio100 lsp30 div100 bol107 ite100 ukn100 eq168 hnf89 smp93 dnf262 smp65 tf100 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 156ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...