./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.10-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.10-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 fbe99a2ebd720adb01c27af71df604a9114f73ca ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:36,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:36,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:36,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:36,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:36,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:36,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:36,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:36,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:36,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:36,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:36,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:36,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:36,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:36,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:36,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:36,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:36,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:36,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:36,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:36,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:36,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:36,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:36,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:36,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:36,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:36,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:36,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:36,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:36,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:36,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:36,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:36,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:36,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:36,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:36,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:36,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:36,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:36,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:36,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:36,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:36,886 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:36,918 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:36,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:36,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:36,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:36,921 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:36,922 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:36,922 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:36,922 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:36,922 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:36,923 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:36,924 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:36,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:36,924 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:36,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:36,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:36,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:36,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:36,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:36,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:36,927 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:36,927 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:36,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:36,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:36,928 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:36,928 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:36,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:36,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:36,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:36,929 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:36,931 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:36,931 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 -> fbe99a2ebd720adb01c27af71df604a9114f73ca [2020-07-29 01:34:37,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:37,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:37,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:37,326 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:37,329 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:37,329 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2020-07-29 01:34:37,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b9931fd5/d85cb1501a5c487ab6bb8617e4d92304/FLAGda8a836a7 [2020-07-29 01:34:37,890 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:37,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2020-07-29 01:34:37,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b9931fd5/d85cb1501a5c487ab6bb8617e4d92304/FLAGda8a836a7 [2020-07-29 01:34:38,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b9931fd5/d85cb1501a5c487ab6bb8617e4d92304 [2020-07-29 01:34:38,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:38,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:38,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:38,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:38,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:38,284 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,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26af0012 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,287 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,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:38,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:38,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:38,724 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:38,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:38,828 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:38,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:38 WrapperNode [2020-07-29 01:34:38,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:38,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:38,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:38,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:38,841 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:38" (1/1) ... [2020-07-29 01:34:38,868 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:38" (1/1) ... [2020-07-29 01:34:38,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:38,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:38,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:38,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:38,924 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:38" (1/1) ... [2020-07-29 01:34:38,924 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:38" (1/1) ... [2020-07-29 01:34:38,944 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:38" (1/1) ... [2020-07-29 01:34:38,944 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:38" (1/1) ... [2020-07-29 01:34:38,953 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:38" (1/1) ... [2020-07-29 01:34:38,961 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:38" (1/1) ... [2020-07-29 01:34:38,963 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:38" (1/1) ... [2020-07-29 01:34:38,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:38,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:38,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:38,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:38,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:38" (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,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:39,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:39,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:39,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:39,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:39,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:39,476 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:39,477 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:34:39,481 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,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:39,482 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:39,482 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:39,486 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:39,487 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:39,487 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,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5faadcd5 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,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:39,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:38" (2/3) ... [2020-07-29 01:34:39,490 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5faadcd5 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,490 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:39,491 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,493 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.10-alloca.i [2020-07-29 01:34:39,547 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:39,548 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:39,548 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:39,548 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:39,549 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:39,549 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:39,549 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:39,549 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:39,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:34:39,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:34:39,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:39,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:39,590 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:39,590 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:39,590 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:39,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:34:39,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:34:39,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:39,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:39,595 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:39,595 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:39,603 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~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;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~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~mem21, 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,603 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~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~mem15;havoc test_fun_#t~mem10;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 7#L556true assume test_fun_#t~mem17 > 0;havoc test_fun_#t~mem17;call test_fun_#t~mem18 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem18 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem18; 5#L559-2true [2020-07-29 01:34:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:34:39,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:39,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380688290] [2020-07-29 01:34:39,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:39,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:39,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:39,823 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:39,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:39,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1790206705, now seen corresponding path program 1 times [2020-07-29 01:34:39,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:39,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998666118] [2020-07-29 01:34:39,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:39,920 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:39,921 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:39,921 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:39,923 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:39,924 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:39,925 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:39,926 INFO L280 TraceCheckUtils]: 6: Hoare triple {25#false} assume !!test_fun_#t~short16;havoc test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~mem15;havoc test_fun_#t~mem10;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {25#false} is VALID [2020-07-29 01:34:39,926 INFO L280 TraceCheckUtils]: 7: Hoare triple {25#false} assume test_fun_#t~mem17 > 0;havoc test_fun_#t~mem17;call test_fun_#t~mem18 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem18 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem18; {25#false} is VALID [2020-07-29 01:34:39,929 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:39,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998666118] [2020-07-29 01:34:39,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:39,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:34:39,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769100181] [2020-07-29 01:34:39,936 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:39,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:39,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:34:39,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:34:39,953 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2020-07-29 01:34:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:40,088 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 01:34:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:34:40,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:40,109 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,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-07-29 01:34:40,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 01:34:40,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2020-07-29 01:34:40,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:34:40,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:34:40,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-07-29 01:34:40,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:40,122 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:34:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-07-29 01:34:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-29 01:34:40,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:40,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand 15 states. [2020-07-29 01:34:40,151 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand 15 states. [2020-07-29 01:34:40,152 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 15 states. [2020-07-29 01:34:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:40,155 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:34:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:34:40,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:40,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:40,157 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states and 22 transitions. [2020-07-29 01:34:40,157 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states and 22 transitions. [2020-07-29 01:34:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:40,159 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:34:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:34:40,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:40,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:40,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:40,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:34:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-07-29 01:34:40,164 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-07-29 01:34:40,164 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-07-29 01:34:40,164 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:40,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2020-07-29 01:34:40,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:40,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:40,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:40,166 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:40,166 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:40,167 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~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;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~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~mem21, 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,167 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~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~mem15;havoc test_fun_#t~mem10;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 56#L556 assume test_fun_#t~mem17 > 0;havoc test_fun_#t~mem17;call test_fun_#t~mem18 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem18 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem18; 53#L559-2 [2020-07-29 01:34:40,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:40,167 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 01:34:40,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:40,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001657565] [2020-07-29 01:34:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,192 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,219 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:40,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1790208627, now seen corresponding path program 1 times [2020-07-29 01:34:40,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:40,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971380545] [2020-07-29 01:34:40,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,270 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,282 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:40,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:40,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1099647153, now seen corresponding path program 1 times [2020-07-29 01:34:40,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:40,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815941193] [2020-07-29 01:34:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:40,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:40,374 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:40,588 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2020-07-29 01:34:41,023 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2020-07-29 01:34:41,208 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-07-29 01:34:41,224 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:41,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:41,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:41,225 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:41,225 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:41,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:41,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:41,227 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.10-alloca.i_Iteration2_Lasso [2020-07-29 01:34:41,227 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:41,227 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:41,287 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,296 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,301 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,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:34:41,310 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,315 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,319 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,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:34:41,332 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,337 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,341 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,726 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2020-07-29 01:34:41,858 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [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,907 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:41,915 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,922 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,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:41,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:41,933 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,937 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,940 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,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:41,948 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,952 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,956 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,959 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,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:42,998 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:43,003 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:43,014 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,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:43,054 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,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,060 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,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:43,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,091 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,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:43,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,124 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,147 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,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,157 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,190 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,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,193 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,216 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,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,220 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,247 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,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:43,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:43,262 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:43,291 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,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,295 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:43,317 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,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:43,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:43,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:43,321 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:43,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:43,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:43,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:43,379 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:43,402 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,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:43,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:43,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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:43,477 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,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:43,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:43,487 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:43,518 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,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:43,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:43,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:43,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:43,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:43,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:43,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:43,682 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:34:43,683 INFO L444 ModelExtractionUtils]: 10 out of 28 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:43,699 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:43,703 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:34:43,704 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:43,704 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:43,847 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2020-07-29 01:34:43,852 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~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~mem15;havoc test_fun_#t~mem10;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);" "assume test_fun_#t~mem17 > 0;havoc test_fun_#t~mem17;call test_fun_#t~mem18 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem18 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem18;" [2020-07-29 01:34:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:43,867 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:43,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:43,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:43,926 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:43,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#unseeded} havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;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~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~mem21, 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:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:43,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:34:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:43,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:43,987 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:43,988 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:43,989 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:43,989 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:43,990 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:43,991 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; {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:43,992 INFO L280 TraceCheckUtils]: 6: 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;havoc test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~mem15;havoc test_fun_#t~mem10;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {261#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (<= |ULTIMATE.start_test_fun_#t~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:43,994 INFO L280 TraceCheckUtils]: 7: Hoare triple {261#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) oldRank0) (<= |ULTIMATE.start_test_fun_#t~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 > 0;havoc test_fun_#t~mem17;call test_fun_#t~mem18 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem18 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem18; {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:43,994 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:43,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:44,007 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:44,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:44,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,013 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:34:44,014 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 01:34:44,160 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 31 states and 45 transitions. Complement of second has 6 states. [2020-07-29 01:34:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:44,160 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:44,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:44,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:44,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:44,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:34:44,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:44,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:44,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:44,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2020-07-29 01:34:44,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:44,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:44,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:44,169 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 21 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:44,174 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 01:34:44,174 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:34:44,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:44,176 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:44,176 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 45 transitions. cyclomatic complexity: 16 [2020-07-29 01:34:44,180 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 01:34:44,180 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:44,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:44,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,182 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:44,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:44,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:44,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:44,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,184 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:44,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:34:44,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,186 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:44,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,186 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:44,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:34:44,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,187 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:44,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,188 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:44,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:34:44,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,189 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:44,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:44,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:44,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:44,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,191 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:44,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:34:44,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,192 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:44,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,193 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:44,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 10 letters. [2020-07-29 01:34:44,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,194 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:44,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,195 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:44,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 10 letters. [2020-07-29 01:34:44,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,196 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:44,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,196 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:44,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 10 letters. [2020-07-29 01:34:44,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,198 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:44,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,198 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:44,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:44,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,199 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:44,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,200 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:44,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 8 letters. [2020-07-29 01:34:44,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,201 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:44,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,202 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:44,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 10 letters. [2020-07-29 01:34:44,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,203 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:44,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,203 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:44,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 01:34:44,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,204 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:44,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,205 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:44,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:34:44,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,206 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:44,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,207 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:44,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:34:44,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,208 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:44,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,208 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:44,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:34:44,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,209 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:44,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,210 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:44,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 8 letters. [2020-07-29 01:34:44,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,211 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:44,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,211 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:44,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:34:44,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,212 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:44,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:44,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:44,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:34:44,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,214 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:44,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:34:44,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,215 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:44,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,216 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:44,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:34:44,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,217 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:44,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,218 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:44,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:34:44,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,219 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:44,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,219 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:44,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:34:44,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,220 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:44,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,221 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:44,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:34:44,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,222 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:44,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,223 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:44,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:34:44,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,224 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:44,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,224 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:44,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:34:44,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,225 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:44,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,226 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:44,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:34:44,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,227 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:44,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,227 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:44,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:34:44,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,228 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:44,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,229 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:44,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:34:44,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,230 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:44,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,231 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:44,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:34:44,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,232 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:44,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,232 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:44,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:34:44,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,233 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:44,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,234 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:44,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:34:44,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,235 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:44,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,235 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:34:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-29 01:34:44,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:34:44,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:34:44,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 16 letters. [2020-07-29 01:34:44,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:44,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. cyclomatic complexity: 16 [2020-07-29 01:34:44,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:44,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 45 transitions. [2020-07-29 01:34:44,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:34:44,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:34:44,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2020-07-29 01:34:44,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:44,247 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-29 01:34:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2020-07-29 01:34:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-07-29 01:34:44,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:44,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 45 transitions. Second operand 30 states. [2020-07-29 01:34:44,253 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 45 transitions. Second operand 30 states. [2020-07-29 01:34:44,253 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 30 states. [2020-07-29 01:34:44,253 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:44,258 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2020-07-29 01:34:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-29 01:34:44,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:44,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:44,259 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states and 45 transitions. [2020-07-29 01:34:44,259 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states and 45 transitions. [2020-07-29 01:34:44,259 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:44,262 INFO L93 Difference]: Finished difference Result 32 states and 47 transitions. [2020-07-29 01:34:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2020-07-29 01:34:44,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:44,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:44,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:44,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:34:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2020-07-29 01:34:44,266 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-07-29 01:34:44,266 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-07-29 01:34:44,266 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:34:44,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 43 transitions. [2020-07-29 01:34:44,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:44,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:44,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:44,267 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:44,268 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:44,268 INFO L794 eck$LassoCheckResult]: Stem: 328#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 326#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;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~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~mem21, 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); 327#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; 310#L555-1 [2020-07-29 01:34:44,268 INFO L796 eck$LassoCheckResult]: Loop: 310#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; 324#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 329#L555-4 assume test_fun_#t~short13; 313#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 314#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; 321#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~mem15;havoc test_fun_#t~mem10;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 316#L556 assume !(test_fun_#t~mem17 > 0);havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 317#L559 assume !(test_fun_#t~mem19 > 0);havoc test_fun_#t~mem19; 309#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; 310#L555-1 [2020-07-29 01:34:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:34:44,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:44,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496380163] [2020-07-29 01:34:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:44,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:44,304 INFO L82 PathProgramCache]: Analyzing trace with hash 572463690, now seen corresponding path program 1 times [2020-07-29 01:34:44,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:44,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67402639] [2020-07-29 01:34:44,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:44,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {448#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; {448#true} is VALID [2020-07-29 01:34:44,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {448#true} test_fun_#t~short13 := test_fun_#t~short8; {448#true} is VALID [2020-07-29 01:34:44,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {448#true} assume test_fun_#t~short13; {448#true} is VALID [2020-07-29 01:34:44,388 INFO L280 TraceCheckUtils]: 3: Hoare triple {448#true} test_fun_#t~short16 := test_fun_#t~short13; {448#true} is VALID [2020-07-29 01:34:44,390 INFO L280 TraceCheckUtils]: 4: Hoare triple {448#true} 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; {450#(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:44,391 INFO L280 TraceCheckUtils]: 5: Hoare triple {450#(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~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~mem15;havoc test_fun_#t~mem10;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {451#(<= 1 (+ (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~mem17|))} is VALID [2020-07-29 01:34:44,392 INFO L280 TraceCheckUtils]: 6: Hoare triple {451#(<= 1 (+ (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~mem17|))} assume !(test_fun_#t~mem17 > 0);havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {452#(<= 1 |ULTIMATE.start_test_fun_#t~mem19|)} is VALID [2020-07-29 01:34:44,393 INFO L280 TraceCheckUtils]: 7: Hoare triple {452#(<= 1 |ULTIMATE.start_test_fun_#t~mem19|)} assume !(test_fun_#t~mem19 > 0);havoc test_fun_#t~mem19; {449#false} is VALID [2020-07-29 01:34:44,393 INFO L280 TraceCheckUtils]: 8: Hoare triple {449#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; {449#false} is VALID [2020-07-29 01:34:44,394 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:44,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67402639] [2020-07-29 01:34:44,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:44,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:34:44,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147017685] [2020-07-29 01:34:44,395 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:44,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:44,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:34:44,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:34:44,396 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-07-29 01:34:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:44,639 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2020-07-29 01:34:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:34:44,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:34:44,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:44,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2020-07-29 01:34:44,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:44,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 41 transitions. [2020-07-29 01:34:44,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:34:44,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:34:44,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2020-07-29 01:34:44,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:44,664 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-07-29 01:34:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2020-07-29 01:34:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-29 01:34:44,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:44,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 41 transitions. Second operand 30 states. [2020-07-29 01:34:44,669 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 41 transitions. Second operand 30 states. [2020-07-29 01:34:44,669 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand 30 states. [2020-07-29 01:34:44,670 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:44,672 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2020-07-29 01:34:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2020-07-29 01:34:44,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:44,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:44,673 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states and 41 transitions. [2020-07-29 01:34:44,673 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states and 41 transitions. [2020-07-29 01:34:44,674 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:44,677 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2020-07-29 01:34:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2020-07-29 01:34:44,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:44,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:44,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:44,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:34:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2020-07-29 01:34:44,681 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-07-29 01:34:44,681 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-07-29 01:34:44,681 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:34:44,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2020-07-29 01:34:44,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 01:34:44,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:44,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:44,685 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:34:44,685 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:44,686 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 508#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;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~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~mem21, 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); 509#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; 492#L555-1 [2020-07-29 01:34:44,686 INFO L796 eck$LassoCheckResult]: Loop: 492#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; 506#L555-3 test_fun_#t~short13 := test_fun_#t~short8; 511#L555-4 assume test_fun_#t~short13; 495#L555-9 test_fun_#t~short16 := test_fun_#t~short13; 496#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; 504#L555-12 assume !!test_fun_#t~short16;havoc test_fun_#t~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~mem15;havoc test_fun_#t~mem10;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 499#L556 assume !(test_fun_#t~mem17 > 0);havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 500#L559 assume test_fun_#t~mem19 > 0;havoc test_fun_#t~mem19;call test_fun_#t~mem20 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem20 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem20; 491#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; 492#L555-1 [2020-07-29 01:34:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2020-07-29 01:34:44,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:44,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327788470] [2020-07-29 01:34:44,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,718 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,750 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:44,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:44,754 INFO L82 PathProgramCache]: Analyzing trace with hash 572463628, now seen corresponding path program 1 times [2020-07-29 01:34:44,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:44,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779301319] [2020-07-29 01:34:44,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:44,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:44,798 INFO L82 PathProgramCache]: Analyzing trace with hash -198955831, now seen corresponding path program 1 times [2020-07-29 01:34:44,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:44,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131022019] [2020-07-29 01:34:44,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:44,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:44,881 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:45,088 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2020-07-29 01:34:45,494 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2020-07-29 01:34:45,673 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-07-29 01:34:45,678 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:45,678 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:45,678 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:45,678 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:45,678 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:45,678 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:45,678 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:45,678 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:45,678 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.10-alloca.i_Iteration4_Lasso [2020-07-29 01:34:45,679 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:45,679 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:45,719 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:45,726 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:45,729 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:45,732 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:45,736 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:45,740 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:45,743 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:45,747 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:45,752 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:45,755 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:45,758 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:45,762 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:45,766 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:45,770 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:45,773 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:45,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:45,783 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:45,787 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:45,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:45,796 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,543 WARN L193 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2020-07-29 01:34:46,699 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2020-07-29 01:34:46,711 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,715 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,718 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,722 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,734 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,731 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-07-29 01:34:47,877 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2020-07-29 01:34:48,074 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:48,074 INFO L489 LassoAnalysis]: Using template 'affine'. 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:48,077 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:48,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,080 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:48,102 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:48,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,105 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:48,131 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:48,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,135 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:48,157 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:48,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:48,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:48,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:48,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:48,195 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:48,217 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:48,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:48,247 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:48,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,250 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:48,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:48,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:48,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:48,277 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:48,301 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:48,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,304 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:48,330 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:48,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:48,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:48,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:48,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:48,427 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:48,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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:48,459 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:48,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,464 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:48,485 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:48,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:48,515 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:48,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:48,540 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:48,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:48,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:48,546 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:48,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:48,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:48,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:48,578 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:48,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:48,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:48,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:48,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:48,604 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:48,630 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:48,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:48,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:48,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:48,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:48,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:48,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:48,665 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:48,687 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:48,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:48,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:48,703 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:48,726 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:48,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:48,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:48,733 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:48,757 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:48,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:48,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:48,772 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) [2020-07-29 01:34:48,794 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:48,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:48,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:48,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:48,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:48,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:48,801 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) [2020-07-29 01:34:48,827 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:48,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:48,829 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:34:48,829 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:34:48,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:48,848 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2020-07-29 01:34:48,848 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:34:48,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:48,977 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-07-29 01:34:48,978 INFO L444 ModelExtractionUtils]: 26 out of 56 variables were initially zero. Simplification set additionally 28 variables to zero. 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:48,980 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:48,983 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-07-29 01:34:48,983 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:48,983 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:49,081 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2020-07-29 01:34:49,085 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~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~mem15;havoc test_fun_#t~mem10;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);" "assume !(test_fun_#t~mem17 > 0);havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume test_fun_#t~mem19 > 0;havoc test_fun_#t~mem19;call test_fun_#t~mem20 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem20 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem20;" "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:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:49,093 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:49,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:49,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:49,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {630#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {630#unseeded} is VALID [2020-07-29 01:34:49,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {630#unseeded} havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24;test_fun_#in~x, test_fun_#in~y := main_#t~nondet22, main_#t~nondet23;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~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~mem21, 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); {630#unseeded} is VALID [2020-07-29 01:34:49,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {630#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; {630#unseeded} is VALID [2020-07-29 01:34:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:49,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:34:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:49,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:49,205 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:49,236 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:49,471 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:49,472 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 45 treesize of output 66 [2020-07-29 01:34:49,502 INFO L523 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-29 01:34:49,513 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:34:49,533 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:49,599 INFO L624 ElimStorePlain]: treesize reduction 62, result has 60.0 percent of original size [2020-07-29 01:34:49,614 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:49,630 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:34:49,637 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-29 01:34:49,637 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:93 [2020-07-29 01:35:01,795 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:01,796 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_89|, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.offset]. (let ((.cse2 (select |v_#memory_int_89| ULTIMATE.start_test_fun_~y_ref~0.base))) (let ((.cse0 (select (select |v_#memory_int_89| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)) (.cse1 (select .cse2 ULTIMATE.start_test_fun_~y_ref~0.offset))) (and (<= .cse0 0) (<= 1 (+ .cse0 .cse1)) (= (store |v_#memory_int_89| ULTIMATE.start_test_fun_~y_ref~0.base (store .cse2 ULTIMATE.start_test_fun_~y_ref~0.offset (+ .cse1 (- 1)))) |#memory_int|) (<= .cse1 oldRank0)))) [2020-07-29 01:35:01,796 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_2, v_prenex_1, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_~x_ref~0.base]. (let ((.cse3 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (and (let ((.cse1 (<= 0 .cse3))) (or (let ((.cse0 (= ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_2))) (and (or (and .cse0 .cse1 (= v_prenex_1 ULTIMATE.start_test_fun_~y_ref~0.base)) (let ((.cse2 (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (<= 0 (+ .cse2 .cse3)) (<= .cse2 0)))) (not .cse0))) (let ((.cse4 (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))) (and (not .cse4) (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) .cse1 .cse4) (let ((.cse5 (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset))) (and (<= 0 (+ .cse5 .cse3)) (<= .cse5 0)))))))) (<= (+ .cse3 1) oldRank0))) [2020-07-29 01:35:01,815 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:01,830 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:35:14,879 WARN L193 SmtUtils]: Spent 12.97 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-29 01:35:14,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {633#(>= 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; {633#(>= 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:14,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {633#(>= 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; {633#(>= 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:14,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {633#(>= 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; {633#(>= 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:14,889 INFO L280 TraceCheckUtils]: 3: Hoare triple {633#(>= 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; {633#(>= 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:14,891 INFO L280 TraceCheckUtils]: 4: Hoare triple {633#(>= 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; {766#(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:14,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {766#(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~short16;havoc test_fun_#t~mem6;havoc test_fun_#t~mem15;havoc test_fun_#t~mem10;havoc test_fun_#t~short8;havoc test_fun_#t~mem9;havoc test_fun_#t~short13;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5;havoc test_fun_#t~mem11;havoc test_fun_#t~short12;havoc test_fun_#t~mem14;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); {770#(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) |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:14,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {770#(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) |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 > 0);havoc test_fun_#t~mem17;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {774#(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) 0) (<= 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:14,905 INFO L280 TraceCheckUtils]: 7: Hoare triple {774#(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) 0) (<= 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~mem19 > 0;havoc test_fun_#t~mem19;call test_fun_#t~mem20 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem20 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem20; {778#(and (or (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (and (<= 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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 0))))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_2)) (or (and (<= (select (select |#memory_int| v_prenex_1) v_prenex_2) 0) (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| v_prenex_1) v_prenex_2)))) (and (= v_prenex_1 ULTIMATE.start_test_fun_~y_ref~0.base) (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (= ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_2)))))) (<= (+ (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:14,907 INFO L280 TraceCheckUtils]: 8: Hoare triple {778#(and (or (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (and (not (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (or (and (= ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (= ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)) (and (<= 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_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) 0))))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_2)) (or (and (<= (select (select |#memory_int| v_prenex_1) v_prenex_2) 0) (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) (select (select |#memory_int| v_prenex_1) v_prenex_2)))) (and (= v_prenex_1 ULTIMATE.start_test_fun_~y_ref~0.base) (<= 0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (= ULTIMATE.start_test_fun_~y_ref~0.offset v_prenex_2)))))) (<= (+ (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; {743#(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:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:14,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:35:26,991 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:26,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:26,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:26,991 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:26,992 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 13 Second operand 7 states. [2020-07-29 01:35:27,351 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 60 states and 89 transitions. Complement of second has 10 states. [2020-07-29 01:35:27,351 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:27,352 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:27,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. cyclomatic complexity: 13 [2020-07-29 01:35:27,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:27,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:27,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:35:27,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:27,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:27,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:27,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 89 transitions. [2020-07-29 01:35:27,355 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:27,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:27,356 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 41 transitions. cyclomatic complexity: 13 [2020-07-29 01:35:27,360 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 01:35:27,360 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:35:27,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:27,362 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:27,363 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 89 transitions. cyclomatic complexity: 32 [2020-07-29 01:35:27,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 89 transitions. cyclomatic complexity: 32 [2020-07-29 01:35:27,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:27,363 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:35:27,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:27,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:27,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:27,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:27,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:27,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:27,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 60 letters. Loop has 60 letters. [2020-07-29 01:35:27,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 60 letters. Loop has 60 letters. [2020-07-29 01:35:27,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 60 letters. Loop has 60 letters. [2020-07-29 01:35:27,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:27,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:27,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:35:27,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:27,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:27,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:35:27,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:27,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:27,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 11 letters. [2020-07-29 01:35:27,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:27,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:27,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 11 letters. [2020-07-29 01:35:27,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:27,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:27,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 7 letters. Loop has 11 letters. [2020-07-29 01:35:27,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:27,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:27,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 11 letters. [2020-07-29 01:35:27,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:27,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:27,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:35:27,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:27,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:27,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:27,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:27,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:27,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:35:27,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:27,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:27,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:35:27,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:27,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:27,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:27,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:27,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:27,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:35:27,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:27,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:27,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:35:27,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:27,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:27,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:35:27,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:27,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:27,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:35:27,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 41 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:27,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:27,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 89 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:35:27,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,385 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:35:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-29 01:35:27,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:35:27,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:35:27,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 3 letters. Loop has 18 letters. [2020-07-29 01:35:27,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 89 transitions. cyclomatic complexity: 32 [2020-07-29 01:35:27,393 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:27,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 0 states and 0 transitions. [2020-07-29 01:35:27,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:35:27,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:35:27,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:35:27,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:27,394 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:27,394 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:27,394 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:27,394 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:35:27,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:35:27,395 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:27,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:27,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:35:27 BoogieIcfgContainer [2020-07-29 01:35:27,401 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:35:27,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:35:27,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:35:27,402 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:35:27,403 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:27,407 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:35:27,407 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:35:27,408 INFO L168 Benchmark]: Toolchain (without parser) took 49129.70 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 333.4 MB). Free memory was 950.8 MB in the beginning and 1.3 GB in the end (delta: -325.3 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:27,409 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:27,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:27,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:27,410 INFO L168 Benchmark]: Boogie Preprocessor took 51.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:27,411 INFO L168 Benchmark]: RCFGBuilder took 515.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:27,411 INFO L168 Benchmark]: BuchiAutomizer took 47919.23 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -238.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:27,412 INFO L168 Benchmark]: Witness Printer took 5.11 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:27,415 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 549.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 515.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 47919.23 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -238.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.11 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 47.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 8.5s. Construction of modules took 0.2s. Büchi inclusion checks took 38.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 56 SDtfs, 31 SDslu, 103 SDs, 0 SdLazy, 101 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital289 mio100 ax106 hnf99 lsp93 ukn78 mio100 lsp33 div100 bol106 ite100 ukn100 eq168 hnf89 smp94 dnf221 smp73 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 158ms 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...