./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/array02-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/array02-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 58d4e5463d025a43f4c9f80bcbe28ceb46ed79b1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:25:13,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:13,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:13,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:13,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:13,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:13,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:13,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:13,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:13,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:13,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:13,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:13,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:13,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:13,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:13,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:13,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:13,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:13,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:13,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:13,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:13,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:13,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:13,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:13,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:13,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:13,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:13,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:13,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:13,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:13,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:13,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:13,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:13,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:13,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:13,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:13,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:13,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:13,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:13,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:13,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:13,977 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:25:14,014 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:14,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:14,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:14,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:14,020 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:14,021 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:14,021 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:14,021 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:14,022 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:14,022 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:14,023 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:14,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:14,024 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:14,024 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:14,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:14,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:14,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:14,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:14,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:14,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:14,027 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:14,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:14,029 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:14,030 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:14,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:14,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:14,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:14,032 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:14,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:14,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:14,033 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:14,035 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:14,036 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:14,037 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58d4e5463d025a43f4c9f80bcbe28ceb46ed79b1 [2020-07-29 03:25:14,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:14,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:14,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:14,347 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:14,347 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:14,348 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2020-07-29 03:25:14,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2585cbf/14c377d19ff1490b95edde585b4134f9/FLAG87e82287d [2020-07-29 03:25:14,967 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:14,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2020-07-29 03:25:14,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2585cbf/14c377d19ff1490b95edde585b4134f9/FLAG87e82287d [2020-07-29 03:25:15,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2585cbf/14c377d19ff1490b95edde585b4134f9 [2020-07-29 03:25:15,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:15,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:15,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:15,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:15,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:15,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:15" (1/1) ... [2020-07-29 03:25:15,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74c4d3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15, skipping insertion in model container [2020-07-29 03:25:15,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:15" (1/1) ... [2020-07-29 03:25:15,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:15,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:15,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:15,810 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:15,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:15,916 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:15,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15 WrapperNode [2020-07-29 03:25:15,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:15,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:15,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:15,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:15,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15" (1/1) ... [2020-07-29 03:25:15,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15" (1/1) ... [2020-07-29 03:25:15,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:15,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:15,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:15,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:15,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15" (1/1) ... [2020-07-29 03:25:15,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15" (1/1) ... [2020-07-29 03:25:15,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15" (1/1) ... [2020-07-29 03:25:15,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15" (1/1) ... [2020-07-29 03:25:15,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15" (1/1) ... [2020-07-29 03:25:15,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15" (1/1) ... [2020-07-29 03:25:15,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15" (1/1) ... [2020-07-29 03:25:15,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:15,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:15,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:15,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:16,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15" (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 03:25:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:16,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:16,451 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:16,451 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-29 03:25:16,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:16 BoogieIcfgContainer [2020-07-29 03:25:16,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:16,456 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:16,456 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:16,460 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:16,461 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:16,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:15" (1/3) ... [2020-07-29 03:25:16,463 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1582780b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:16, skipping insertion in model container [2020-07-29 03:25:16,463 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:16,463 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:15" (2/3) ... [2020-07-29 03:25:16,464 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1582780b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:16, skipping insertion in model container [2020-07-29 03:25:16,464 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:16,464 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:16" (3/3) ... [2020-07-29 03:25:16,466 INFO L371 chiAutomizerObserver]: Analyzing ICFG array02-alloca-2.i [2020-07-29 03:25:16,540 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:16,540 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:16,540 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:16,541 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:16,541 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:16,541 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:16,541 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:16,542 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:16,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 03:25:16,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:25:16,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:16,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:16,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:25:16,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:16,590 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:16,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 03:25:16,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:25:16,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:16,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:16,594 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:25:16,595 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:16,603 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 14#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 16#L530-2true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 10#L535-3true [2020-07-29 03:25:16,603 INFO L796 eck$LassoCheckResult]: Loop: 10#L535-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 7#L535-2true main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 10#L535-3true [2020-07-29 03:25:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 03:25:16,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:16,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990821694] [2020-07-29 03:25:16,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,724 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,743 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:16,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:16,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-07-29 03:25:16,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:16,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635266965] [2020-07-29 03:25:16,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,779 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:16,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:16,787 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-07-29 03:25:16,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:16,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520618343] [2020-07-29 03:25:16,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,826 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,846 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:17,101 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:17,102 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:17,102 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:17,103 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:17,103 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:17,103 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:17,103 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:17,104 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:17,104 INFO L133 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration1_Lasso [2020-07-29 03:25:17,104 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:17,104 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:17,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:17,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:17,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:17,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:17,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:17,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:17,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:17,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:17,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:17,918 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:17,924 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:17,930 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 03:25:17,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:17,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:17,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:17,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:17,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:17,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:17,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:17,941 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 03:25:17,979 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 03:25:17,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:17,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:17,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:17,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:17,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:17,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:17,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:17,985 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 03:25:18,020 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 03:25:18,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:18,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:18,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:18,026 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 03:25:18,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:18,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:18,074 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) [2020-07-29 03:25:18,112 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 03:25:18,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:18,126 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 03:25:18,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:18,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:18,168 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 03:25:18,195 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 03:25:18,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:18,211 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) [2020-07-29 03:25:18,251 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:18,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:18,275 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:18,324 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-07-29 03:25:18,324 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. 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 03:25:18,370 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:18,409 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:18,410 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:18,411 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2020-07-29 03:25:18,494 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 03:25:18,501 INFO L393 LassoCheck]: Loop: "assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14;" "main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13;" [2020-07-29 03:25:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:18,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:18,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:18,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {27#unseeded} is VALID [2020-07-29 03:25:18,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {27#unseeded} is VALID [2020-07-29 03:25:18,597 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {27#unseeded} is VALID [2020-07-29 03:25:18,598 INFO L280 TraceCheckUtils]: 3: Hoare triple {27#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {27#unseeded} is VALID [2020-07-29 03:25:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:18,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:18,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:18,636 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~array_size~0))} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {69#(and (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~array_size~0) (<= ULTIMATE.start_main_~array_size~0 (+ oldRank0 ULTIMATE.start_main_~k~0)))} is VALID [2020-07-29 03:25:18,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {69#(and (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~array_size~0) (<= ULTIMATE.start_main_~array_size~0 (+ oldRank0 ULTIMATE.start_main_~k~0)))} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {55#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~array_size~0))) unseeded)} is VALID [2020-07-29 03:25:18,638 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 03:25:18,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:18,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:18,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:18,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,674 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 03:25:18,676 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2020-07-29 03:25:18,813 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 41 states and 61 transitions. Complement of second has 7 states. [2020-07-29 03:25:18,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:18,814 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:18,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 03:25:18,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:25:18,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:18,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:18,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:18,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:18,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:18,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:18,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 61 transitions. [2020-07-29 03:25:18,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:25:18,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:18,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:18,829 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states. [2020-07-29 03:25:18,831 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:25:18,834 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:25:18,834 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:18,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:18,838 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:18,839 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 61 transitions. cyclomatic complexity: 24 [2020-07-29 03:25:18,840 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:25:18,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:18,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:18,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:18,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:18,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:18,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:18,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:18,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:18,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:18,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:25:18,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:25:18,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:25:18,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:18,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:18,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:18,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:18,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:18,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:18,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:18,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:18,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:18,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:18,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:18,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:18,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:18,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:18,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:18,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:18,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:18,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:18,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:18,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:18,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:18,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:18,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:18,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:18,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:18,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:18,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:18,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:18,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:18,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:18,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:18,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:18,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:18,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:18,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:18,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:18,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:18,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:18,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:18,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:18,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:18,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:18,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:18,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:18,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:18,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:18,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:18,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:18,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 03:25:18,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 03:25:18,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 11 letters. Loop has 6 letters. [2020-07-29 03:25:18,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:18,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:18,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 61 transitions. cyclomatic complexity: 24 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:18,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,878 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-29 03:25:18,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:18,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:18,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:18,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:18,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 61 transitions. cyclomatic complexity: 24 [2020-07-29 03:25:18,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:25:18,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 14 states and 19 transitions. [2020-07-29 03:25:18,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:25:18,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:25:18,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-07-29 03:25:18,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:18,898 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 03:25:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-07-29 03:25:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-29 03:25:18,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:18,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand 14 states. [2020-07-29 03:25:18,928 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand 14 states. [2020-07-29 03:25:18,931 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 14 states. [2020-07-29 03:25:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:18,942 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 03:25:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-29 03:25:18,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:18,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:18,944 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states and 19 transitions. [2020-07-29 03:25:18,944 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states and 19 transitions. [2020-07-29 03:25:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:18,947 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 03:25:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-29 03:25:18,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:18,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:18,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:18,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 03:25:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-07-29 03:25:18,956 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 03:25:18,956 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 03:25:18,956 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:18,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-07-29 03:25:18,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:25:18,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:18,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:18,958 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:18,958 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:18,960 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 132#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 133#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 137#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 134#L535-3 assume !(main_~k~0 < main_~array_size~0); 135#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 127#L517-3 [2020-07-29 03:25:18,960 INFO L796 eck$LassoCheckResult]: Loop: 127#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 124#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 125#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 131#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 130#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 126#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 127#L517-3 [2020-07-29 03:25:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-07-29 03:25:18,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:18,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872695625] [2020-07-29 03:25:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:19,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {169#true} is VALID [2020-07-29 03:25:19,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {169#true} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {169#true} is VALID [2020-07-29 03:25:19,040 INFO L280 TraceCheckUtils]: 2: Hoare triple {169#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {171#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:25:19,041 INFO L280 TraceCheckUtils]: 3: Hoare triple {171#(<= 1 ULTIMATE.start_main_~array_size~0)} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {172#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~k~0))} is VALID [2020-07-29 03:25:19,042 INFO L280 TraceCheckUtils]: 4: Hoare triple {172#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~k~0))} assume !(main_~k~0 < main_~array_size~0); {170#false} is VALID [2020-07-29 03:25:19,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {170#false} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {170#false} is VALID [2020-07-29 03:25:19,044 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 03:25:19,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872695625] [2020-07-29 03:25:19,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:19,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:25:19,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829299985] [2020-07-29 03:25:19,050 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:19,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:19,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1809463733, now seen corresponding path program 1 times [2020-07-29 03:25:19,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:19,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998574966] [2020-07-29 03:25:19,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:19,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:19,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:25:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:25:19,205 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 03:25:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:19,283 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 03:25:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:25:19,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:19,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:19,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2020-07-29 03:25:19,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:25:19,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2020-07-29 03:25:19,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:25:19,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:25:19,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-07-29 03:25:19,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:19,302 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 03:25:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-07-29 03:25:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-07-29 03:25:19,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:19,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 19 transitions. Second operand 14 states. [2020-07-29 03:25:19,305 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 19 transitions. Second operand 14 states. [2020-07-29 03:25:19,305 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 14 states. [2020-07-29 03:25:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:19,307 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 03:25:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-07-29 03:25:19,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:19,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:19,308 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states and 19 transitions. [2020-07-29 03:25:19,308 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states and 19 transitions. [2020-07-29 03:25:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:19,312 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 03:25:19,312 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-07-29 03:25:19,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:19,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:19,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:19,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 03:25:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-07-29 03:25:19,315 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 03:25:19,315 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 03:25:19,315 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:19,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-07-29 03:25:19,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:25:19,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:19,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:19,319 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:19,319 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:19,320 INFO L794 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 198#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 199#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 203#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 200#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 194#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 195#L535-3 assume !(main_~k~0 < main_~array_size~0); 201#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 193#L517-3 [2020-07-29 03:25:19,320 INFO L796 eck$LassoCheckResult]: Loop: 193#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 190#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 191#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 197#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 196#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 192#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 193#L517-3 [2020-07-29 03:25:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-07-29 03:25:19,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:19,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632504838] [2020-07-29 03:25:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,389 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:19,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:19,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1809463733, now seen corresponding path program 2 times [2020-07-29 03:25:19,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:19,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432501971] [2020-07-29 03:25:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,402 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,411 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:19,411 INFO L82 PathProgramCache]: Analyzing trace with hash -258934749, now seen corresponding path program 1 times [2020-07-29 03:25:19,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:19,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570369974] [2020-07-29 03:25:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,481 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:19,760 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2020-07-29 03:25:19,899 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:19,899 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:19,899 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:19,899 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:19,900 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:19,900 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:19,900 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:19,900 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:19,900 INFO L133 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration3_Lasso [2020-07-29 03:25:19,900 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:19,900 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:19,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:19,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 03:25:20,162 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-07-29 03:25:20,230 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:20,230 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:20,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:20,709 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-07-29 03:25:21,175 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:21,175 INFO L489 LassoAnalysis]: Using template 'affine'. 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 03:25:21,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:21,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:21,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:21,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:21,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:21,239 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,251 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 03:25:21,279 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 03:25:21,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,316 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 03:25:21,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:25:21,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:21,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:21,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,441 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:21,484 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 03:25:21,484 INFO L444 ModelExtractionUtils]: 18 out of 40 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 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 03:25:21,486 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:21,490 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:25:21,490 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:21,490 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~a.offset, ULTIMATE.start_test_fun_~i~0) = -1*ULTIMATE.start_test_fun_~a.offset - 4*ULTIMATE.start_test_fun_~i~0 + 1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_2 + 4 >= 0] [2020-07-29 03:25:21,543 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:21,552 INFO L393 LassoCheck]: Loop: "assume !!(test_fun_~i~0 < test_fun_~N);" "call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;" "call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;" "test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2;" [2020-07-29 03:25:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 03:25:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:21,674 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-07-29 03:25:21,675 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:21,688 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:21,689 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:25:21,689 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 03:25:21,693 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:21,693 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_46|]. (and unseeded (= |#length| (store |v_#length_46| ULTIMATE.start_main_~numbers~0.base (* ULTIMATE.start_main_~array_size~0 4))) (<= ULTIMATE.start_main_~k~0 0)) [2020-07-29 03:25:21,694 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* ULTIMATE.start_main_~array_size~0 4)) unseeded (<= ULTIMATE.start_main_~k~0 0)) [2020-07-29 03:25:21,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {243#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {243#unseeded} is VALID [2020-07-29 03:25:21,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {243#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {243#unseeded} is VALID [2020-07-29 03:25:21,888 INFO L280 TraceCheckUtils]: 2: Hoare triple {243#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {243#unseeded} is VALID [2020-07-29 03:25:21,889 INFO L280 TraceCheckUtils]: 3: Hoare triple {243#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {306#(and unseeded (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_main_~k~0 0))} is VALID [2020-07-29 03:25:21,892 INFO L280 TraceCheckUtils]: 4: Hoare triple {306#(and unseeded (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_main_~k~0 0))} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {306#(and unseeded (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_main_~k~0 0))} is VALID [2020-07-29 03:25:21,899 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#(and unseeded (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_main_~k~0 0))} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {313#(and unseeded (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_main_~k~0 1))} is VALID [2020-07-29 03:25:21,901 INFO L280 TraceCheckUtils]: 6: Hoare triple {313#(and unseeded (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_main_~k~0 1))} assume !(main_~k~0 < main_~array_size~0); {317#(and (<= (div (* (select |#length| ULTIMATE.start_main_~numbers~0.base) (- 1)) (- 4)) 1) (= 0 (mod (* (select |#length| ULTIMATE.start_main_~numbers~0.base) 3) (- 4))) unseeded)} is VALID [2020-07-29 03:25:21,902 INFO L280 TraceCheckUtils]: 7: Hoare triple {317#(and (<= (div (* (select |#length| ULTIMATE.start_main_~numbers~0.base) (- 1)) (- 4)) 1) (= 0 (mod (* (select |#length| ULTIMATE.start_main_~numbers~0.base) 3) (- 4))) unseeded)} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {288#(and (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~numbers~0.base)) 4) 0) unseeded)} is VALID [2020-07-29 03:25:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:25:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:22,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {289#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_test_fun_~a.offset) (* (- 4) ULTIMATE.start_test_fun_~i~0) 1)) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~numbers~0.base)) 4) 0))} assume !!(test_fun_~i~0 < test_fun_~N); {289#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_test_fun_~a.offset) (* (- 4) ULTIMATE.start_test_fun_~i~0) 1)) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~numbers~0.base)) 4) 0))} is VALID [2020-07-29 03:25:22,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {289#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_test_fun_~a.offset) (* (- 4) ULTIMATE.start_test_fun_~i~0) 1)) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~numbers~0.base)) 4) 0))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {324#(and (<= 1 (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (<= (select |#length| ULTIMATE.start_main_~numbers~0.base) 4) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} is VALID [2020-07-29 03:25:22,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {324#(and (<= 1 (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (<= (select |#length| ULTIMATE.start_main_~numbers~0.base) 4) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {324#(and (<= 1 (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (<= (select |#length| ULTIMATE.start_main_~numbers~0.base) 4) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} is VALID [2020-07-29 03:25:22,009 INFO L280 TraceCheckUtils]: 3: Hoare triple {324#(and (<= 1 (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (<= (select |#length| ULTIMATE.start_main_~numbers~0.base) 4) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {324#(and (<= 1 (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (<= (select |#length| ULTIMATE.start_main_~numbers~0.base) 4) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} is VALID [2020-07-29 03:25:22,010 INFO L280 TraceCheckUtils]: 4: Hoare triple {324#(and (<= 1 (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (<= (select |#length| ULTIMATE.start_main_~numbers~0.base) 4) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; {324#(and (<= 1 (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (<= (select |#length| ULTIMATE.start_main_~numbers~0.base) 4) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} is VALID [2020-07-29 03:25:22,012 INFO L280 TraceCheckUtils]: 5: Hoare triple {324#(and (<= 1 (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (<= (select |#length| ULTIMATE.start_main_~numbers~0.base) 4) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {291#(and (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~numbers~0.base)) 4) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_test_fun_~a.offset) (* (- 4) ULTIMATE.start_test_fun_~i~0) 1))) unseeded))} is VALID [2020-07-29 03:25:22,012 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 03:25:22,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:25:22,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:22,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 03:25:22,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,044 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-07-29 03:25:22,044 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-07-29 03:25:22,331 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 34 states and 44 transitions. Complement of second has 11 states. [2020-07-29 03:25:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-29 03:25:22,331 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:22,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. cyclomatic complexity: 6 [2020-07-29 03:25:22,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:22,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:22,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 03:25:22,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:22,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:22,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:22,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2020-07-29 03:25:22,340 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:25:22,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:22,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:22,342 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 18 transitions. cyclomatic complexity: 6 [2020-07-29 03:25:22,346 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:25:22,347 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 03:25:22,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:22,351 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:22,352 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 44 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:22,356 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 03:25:22,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 6 letters. [2020-07-29 03:25:22,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 03:25:22,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 6 letters. [2020-07-29 03:25:22,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:25:22,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:25:22,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:25:22,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:22,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:22,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:22,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:22,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:22,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:22,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 14 letters. [2020-07-29 03:25:22,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 03:25:22,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 14 letters. [2020-07-29 03:25:22,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:25:22,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:25:22,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:25:22,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:22,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:22,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:22,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 6 letters. [2020-07-29 03:25:22,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 03:25:22,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 6 letters. [2020-07-29 03:25:22,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:22,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:22,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:22,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:22,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:22,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:22,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:22,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:22,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:22,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:22,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:22,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:22,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:25:22,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:25:22,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 03:25:22,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:22,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:22,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:22,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:22,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:22,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:22,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:22,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:22,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:22,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:22,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:22,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:22,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:22,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:22,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:22,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:22,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:22,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:22,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:22,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:22,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:22,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:22,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:22,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:22,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:25:22,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:25:22,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:25:22,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:22,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:22,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:22,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,390 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 03:25:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2020-07-29 03:25:22,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-29 03:25:22,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:25:22,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 8 letters. Loop has 12 letters. [2020-07-29 03:25:22,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:22,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:22,406 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:25:22,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 43 transitions. [2020-07-29 03:25:22,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-29 03:25:22,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-07-29 03:25:22,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2020-07-29 03:25:22,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:22,414 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-07-29 03:25:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2020-07-29 03:25:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-07-29 03:25:22,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:22,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 43 transitions. Second operand 28 states. [2020-07-29 03:25:22,418 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 43 transitions. Second operand 28 states. [2020-07-29 03:25:22,418 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 28 states. [2020-07-29 03:25:22,419 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:22,422 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-07-29 03:25:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2020-07-29 03:25:22,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:22,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:22,423 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 33 states and 43 transitions. [2020-07-29 03:25:22,423 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 33 states and 43 transitions. [2020-07-29 03:25:22,424 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:22,433 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-07-29 03:25:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2020-07-29 03:25:22,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:22,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:22,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:22,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 03:25:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-29 03:25:22,436 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-29 03:25:22,436 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-29 03:25:22,436 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:25:22,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2020-07-29 03:25:22,437 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:25:22,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:22,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:22,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:22,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:22,438 INFO L794 eck$LassoCheckResult]: Stem: 414#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 409#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 410#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 415#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 411#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 403#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 404#L535-3 assume !(main_~k~0 < main_~array_size~0); 413#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 402#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 394#L518-3 [2020-07-29 03:25:22,438 INFO L796 eck$LassoCheckResult]: Loop: 394#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 395#L518-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 394#L518-3 [2020-07-29 03:25:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:22,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2020-07-29 03:25:22,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:22,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996407658] [2020-07-29 03:25:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,506 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,511 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:22,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:22,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2020-07-29 03:25:22,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:22,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504786579] [2020-07-29 03:25:22,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,524 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:22,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2020-07-29 03:25:22,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:22,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062267071] [2020-07-29 03:25:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:22,800 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2020-07-29 03:25:22,933 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:22,933 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:22,933 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:22,933 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:22,934 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:22,934 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:22,934 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:22,934 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:22,934 INFO L133 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration4_Lasso [2020-07-29 03:25:22,934 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:22,934 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:22,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:22,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:22,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:22,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,176 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2020-07-29 03:25:23,262 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:23,262 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:23,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,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 03:25:23,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,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 03:25:23,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,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 03:25:23,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 03:25:23,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 03:25:23,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:24,185 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:24,186 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 03:25:24,192 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 03:25:24,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:24,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:24,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:25:24,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:24,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:24,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:24,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:24,226 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) [2020-07-29 03:25:24,276 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 03:25:24,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:24,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:24,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:24,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 20 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 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 03:25:24,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:24,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:24,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:24,326 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) [2020-07-29 03:25:24,368 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 03:25:24,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:24,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:25:24,407 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 03:25:24,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:24,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:24,413 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 03:25:24,445 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 03:25:24,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:24,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:24,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:24,466 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:25:24,466 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:25:24,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:24,470 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:24,470 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:24,470 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4)))_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4)))_1 Supporting invariants [] [2020-07-29 03:25:24,518 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:24,526 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6;" [2020-07-29 03:25:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 03:25:24,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 03:25:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:24,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {579#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {579#unseeded} is VALID [2020-07-29 03:25:24,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {579#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {579#unseeded} is VALID [2020-07-29 03:25:24,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {579#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {579#unseeded} is VALID [2020-07-29 03:25:24,682 INFO L280 TraceCheckUtils]: 3: Hoare triple {579#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {642#(and (= 0 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 03:25:24,683 INFO L280 TraceCheckUtils]: 4: Hoare triple {642#(and (= 0 ULTIMATE.start_main_~k~0) unseeded)} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {642#(and (= 0 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 03:25:24,684 INFO L280 TraceCheckUtils]: 5: Hoare triple {642#(and (= 0 ULTIMATE.start_main_~k~0) unseeded)} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {649#(and (= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 03:25:24,684 INFO L280 TraceCheckUtils]: 6: Hoare triple {649#(and (= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !(main_~k~0 < main_~array_size~0); {649#(and (= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 03:25:24,686 INFO L280 TraceCheckUtils]: 7: Hoare triple {649#(and (= 1 ULTIMATE.start_main_~k~0) unseeded)} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {656#(and (= 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= 0 ULTIMATE.start_test_fun_~i~0) (= ULTIMATE.start_main_~numbers~0.offset ULTIMATE.start_test_fun_~a.offset) unseeded)} is VALID [2020-07-29 03:25:24,687 INFO L280 TraceCheckUtils]: 8: Hoare triple {656#(and (= 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= 0 ULTIMATE.start_test_fun_~i~0) (= ULTIMATE.start_main_~numbers~0.offset ULTIMATE.start_test_fun_~a.offset) unseeded)} assume !!(test_fun_~i~0 < test_fun_~N); {624#(and (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4))) unseeded)} is VALID [2020-07-29 03:25:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:25:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:24,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {625#(and (>= oldRank0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4))))) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4))))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {660#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) |ULTIMATE.start_test_fun_#t~mem3|) (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4))) oldRank0)) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (+ ULTIMATE.start_main_~numbers~0.offset (* 4 ULTIMATE.start_main_~k~0))))} is VALID [2020-07-29 03:25:24,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {660#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) |ULTIMATE.start_test_fun_#t~mem3|) (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4))) oldRank0)) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (+ ULTIMATE.start_main_~numbers~0.offset (* 4 ULTIMATE.start_main_~k~0))))} assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; {627#(and (or unseeded (and (> oldRank0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4))))) (>= oldRank0 0))) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4))))} is VALID [2020-07-29 03:25:24,752 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 03:25:24,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:25:24,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:24,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:24,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,774 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-07-29 03:25:24,774 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 38 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-07-29 03:25:25,022 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 38 transitions. cyclomatic complexity: 15. Second operand 6 states. Result 49 states and 64 transitions. Complement of second has 11 states. [2020-07-29 03:25:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-29 03:25:25,023 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:25,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:25,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:25,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:25,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:25:25,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:25,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:25,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:25,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2020-07-29 03:25:25,026 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:25:25,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:25,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:25,027 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 38 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:25,029 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 03:25:25,029 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:25:25,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:25,030 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:25,030 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 64 transitions. cyclomatic complexity: 22 [2020-07-29 03:25:25,033 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 03:25:25,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:25,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:25,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:25,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:25,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:25,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:25,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:25:25,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:25:25,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:25:25,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 28 letters. Loop has 28 letters. [2020-07-29 03:25:25,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 03:25:25,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 28 letters. Loop has 28 letters. [2020-07-29 03:25:25,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:25:25,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:25:25,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:25:25,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:25,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:25,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:25,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:25,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:25,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:25,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:25,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:25,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:25,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:25,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:25,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:25,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:25,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:25,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:25,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:25,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:25,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:25,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:25,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:25,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:25,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:25,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:25,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:25,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:25,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:25,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:25,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:25,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:25,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:25,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:25,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:25,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:25,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:25,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:25,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:25,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:25,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:25:25,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:25:25,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:25:25,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 64 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:25,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,073 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:25:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2020-07-29 03:25:25,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:25,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:25,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:25,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. cyclomatic complexity: 22 [2020-07-29 03:25:25,093 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:25:25,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 59 transitions. [2020-07-29 03:25:25,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-29 03:25:25,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-07-29 03:25:25,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 59 transitions. [2020-07-29 03:25:25,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:25,100 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2020-07-29 03:25:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 59 transitions. [2020-07-29 03:25:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2020-07-29 03:25:25,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:25,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states and 59 transitions. Second operand 35 states. [2020-07-29 03:25:25,105 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states and 59 transitions. Second operand 35 states. [2020-07-29 03:25:25,105 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand 35 states. [2020-07-29 03:25:25,105 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:25,108 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2020-07-29 03:25:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2020-07-29 03:25:25,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:25,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:25,109 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 44 states and 59 transitions. [2020-07-29 03:25:25,109 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 44 states and 59 transitions. [2020-07-29 03:25:25,109 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:25,112 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2020-07-29 03:25:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2020-07-29 03:25:25,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:25,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:25,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:25,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 03:25:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2020-07-29 03:25:25,115 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 48 transitions. [2020-07-29 03:25:25,115 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 48 transitions. [2020-07-29 03:25:25,115 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:25:25,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 48 transitions. [2020-07-29 03:25:25,115 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:25:25,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:25,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:25,116 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:25,116 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:25,116 INFO L794 eck$LassoCheckResult]: Stem: 758#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 753#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 754#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 759#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 755#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 756#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 769#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 747#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 748#L535-3 assume !(main_~k~0 < main_~array_size~0); 757#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 741#L517-3 [2020-07-29 03:25:25,116 INFO L796 eck$LassoCheckResult]: Loop: 741#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 764#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 763#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 762#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 761#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 740#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 741#L517-3 [2020-07-29 03:25:25,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2020-07-29 03:25:25,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:25,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966032597] [2020-07-29 03:25:25,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,142 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:25,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1809463733, now seen corresponding path program 3 times [2020-07-29 03:25:25,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:25,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74306102] [2020-07-29 03:25:25,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,152 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:25,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1805345413, now seen corresponding path program 2 times [2020-07-29 03:25:25,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:25,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123274008] [2020-07-29 03:25:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,172 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,193 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:25,483 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2020-07-29 03:25:25,617 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:25,617 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:25,617 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:25,618 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:25,618 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:25,618 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:25,618 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:25,618 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:25,618 INFO L133 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration5_Lasso [2020-07-29 03:25:25,618 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:25,619 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:25,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,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 03:25:25,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,848 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-07-29 03:25:25,884 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:25,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:26,557 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:26,557 INFO L489 LassoAnalysis]: Using template 'affine'. 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 03:25:26,562 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 03:25:26,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:26,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:26,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:26,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:26,589 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 03:25:26,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:26,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:26,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:26,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:26,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 03:25:26,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:26,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:26,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:26,660 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 03:25:26,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:26,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:26,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:26,663 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 03:25:26,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 03:25:26,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:26,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:26,697 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 03:25:26,730 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 03:25:26,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:26,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:26,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:26,735 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 03:25:26,759 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 03:25:26,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:26,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:26,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:25:26,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:26,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:26,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:26,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:26,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:25:26,821 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 03:25:26,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:26,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:26,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:26,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:25:26,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:26,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:26,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:26,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:26,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:26,871 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 03:25:26,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:26,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:26,878 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) [2020-07-29 03:25:26,902 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 03:25:26,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:26,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:26,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:26,906 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 03:25:26,929 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 03:25:26,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:26,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:26,934 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 03:25:26,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:26,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:26,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:26,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:26,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:26,985 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 03:25:26,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:26,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:26,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,015 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 03:25:27,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:27,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:27,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:27,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,042 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 03:25:27,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:27,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:27,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:27,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,070 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 03:25:27,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:27,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:27,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:27,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,097 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 03:25:27,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:27,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:27,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,132 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 03:25:27,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:27,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:27,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:27,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,159 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 03:25:27,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:27,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:27,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,191 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 03:25:27,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:27,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:27,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:27,270 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-07-29 03:25:27,270 INFO L444 ModelExtractionUtils]: 7 out of 37 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:27,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,277 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:27,277 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:27,278 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~a.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_4, ULTIMATE.start_test_fun_~i~0) = -1*ULTIMATE.start_test_fun_~a.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_4 - 4*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2020-07-29 03:25:27,330 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 03:25:27,335 INFO L393 LassoCheck]: Loop: "assume !!(test_fun_~i~0 < test_fun_~N);" "call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;" "call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;" "test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2;" [2020-07-29 03:25:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:27,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:27,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:25:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:27,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:27,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {960#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {960#unseeded} is VALID [2020-07-29 03:25:27,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {960#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {960#unseeded} is VALID [2020-07-29 03:25:27,417 INFO L280 TraceCheckUtils]: 2: Hoare triple {960#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {960#unseeded} is VALID [2020-07-29 03:25:27,418 INFO L280 TraceCheckUtils]: 3: Hoare triple {960#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:25:27,419 INFO L280 TraceCheckUtils]: 4: Hoare triple {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:25:27,419 INFO L280 TraceCheckUtils]: 5: Hoare triple {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:25:27,420 INFO L280 TraceCheckUtils]: 6: Hoare triple {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:25:27,420 INFO L280 TraceCheckUtils]: 7: Hoare triple {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:25:27,421 INFO L280 TraceCheckUtils]: 8: Hoare triple {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} assume !(main_~k~0 < main_~array_size~0); {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:25:27,421 INFO L280 TraceCheckUtils]: 9: Hoare triple {1007#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {989#(and (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:25:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:27,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:25:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:27,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:27,471 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_test_fun_~a.offset) (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (* (- 4) ULTIMATE.start_test_fun_~i~0))) (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|))} assume !!(test_fun_~i~0 < test_fun_~N); {990#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_test_fun_~a.offset) (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (* (- 4) ULTIMATE.start_test_fun_~i~0))) (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 03:25:27,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_test_fun_~a.offset) (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (* (- 4) ULTIMATE.start_test_fun_~i~0))) (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1029#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} is VALID [2020-07-29 03:25:27,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {1029#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {1029#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} is VALID [2020-07-29 03:25:27,474 INFO L280 TraceCheckUtils]: 3: Hoare triple {1029#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1029#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} is VALID [2020-07-29 03:25:27,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {1029#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; {1029#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} is VALID [2020-07-29 03:25:27,480 INFO L280 TraceCheckUtils]: 5: Hoare triple {1029#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ (* 4 ULTIMATE.start_test_fun_~i~0) oldRank0 ULTIMATE.start_test_fun_~a.offset)) (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|) (<= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4) (select |#length| ULTIMATE.start_test_fun_~a.base)))} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {992#(and (= ULTIMATE.start_test_fun_~a.base |ULTIMATE.start_main_#t~malloc12.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_test_fun_~a.offset) (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (* (- 4) ULTIMATE.start_test_fun_~i~0)))) unseeded))} is VALID [2020-07-29 03:25:27,480 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 03:25:27,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:25:27,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:27,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:27,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,495 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:25:27,495 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 48 transitions. cyclomatic complexity: 20 Second operand 5 states. [2020-07-29 03:25:27,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 48 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 65 states and 92 transitions. Complement of second has 7 states. [2020-07-29 03:25:27,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:27,595 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:27,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 48 transitions. cyclomatic complexity: 20 [2020-07-29 03:25:27,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:27,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:27,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:25:27,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:27,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:27,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:27,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 92 transitions. [2020-07-29 03:25:27,598 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:27,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:27,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:27,599 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 48 transitions. cyclomatic complexity: 20 [2020-07-29 03:25:27,600 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 03:25:27,601 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:25:27,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:27,602 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:27,602 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 65 states and 92 transitions. cyclomatic complexity: 42 [2020-07-29 03:25:27,603 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:25:27,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:27,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:27,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:27,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:27,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:27,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:27,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 65 letters. Loop has 65 letters. [2020-07-29 03:25:27,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 65 letters. Loop has 65 letters. [2020-07-29 03:25:27,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 65 letters. Loop has 65 letters. [2020-07-29 03:25:27,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:25:27,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:25:27,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:25:27,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:27,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:27,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:27,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:27,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:27,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:27,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:27,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:27,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:27,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:27,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:27,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:27,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:27,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:27,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:27,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:27,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:27,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:27,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:27,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:27,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 2 letters. Loop has 3 letters. [2020-07-29 03:25:27,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:27,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:27,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:27,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:27,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:27,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:27,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:27,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:27,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:27,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:27,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:27,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:27,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:27,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:27,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:27,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:27,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 92 transitions. cyclomatic complexity: 42 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:27,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,626 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:25:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-29 03:25:27,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:27,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:25:27,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 10 letters. Loop has 12 letters. [2020-07-29 03:25:27,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:27,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 92 transitions. cyclomatic complexity: 42 [2020-07-29 03:25:27,631 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:27,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 45 states and 62 transitions. [2020-07-29 03:25:27,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 03:25:27,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 03:25:27,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 62 transitions. [2020-07-29 03:25:27,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:27,634 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2020-07-29 03:25:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 62 transitions. [2020-07-29 03:25:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2020-07-29 03:25:27,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:27,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 62 transitions. Second operand 29 states. [2020-07-29 03:25:27,637 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 62 transitions. Second operand 29 states. [2020-07-29 03:25:27,637 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand 29 states. [2020-07-29 03:25:27,637 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:27,640 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2020-07-29 03:25:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2020-07-29 03:25:27,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:27,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:27,641 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 45 states and 62 transitions. [2020-07-29 03:25:27,641 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 45 states and 62 transitions. [2020-07-29 03:25:27,641 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:27,644 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2020-07-29 03:25:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2020-07-29 03:25:27,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:27,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:27,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:27,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 03:25:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-07-29 03:25:27,646 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-07-29 03:25:27,646 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-07-29 03:25:27,647 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:25:27,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. [2020-07-29 03:25:27,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:27,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:27,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:27,648 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:27,648 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:27,648 INFO L794 eck$LassoCheckResult]: Stem: 1137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1132#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 1133#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1138#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 1134#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 1135#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 1147#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 1126#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 1127#L535-3 assume !(main_~k~0 < main_~array_size~0); 1136#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 1125#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 1119#L518-3 [2020-07-29 03:25:27,648 INFO L796 eck$LassoCheckResult]: Loop: 1119#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1120#L518-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 1119#L518-3 [2020-07-29 03:25:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:27,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2020-07-29 03:25:27,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:27,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960473379] [2020-07-29 03:25:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:27,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:27,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:27,675 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:27,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2020-07-29 03:25:27,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:27,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863063163] [2020-07-29 03:25:27,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:27,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:27,683 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:27,685 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:27,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash -856885645, now seen corresponding path program 2 times [2020-07-29 03:25:27,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:27,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448567923] [2020-07-29 03:25:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:27,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:27,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:27,721 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:28,029 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2020-07-29 03:25:28,162 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:28,162 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:28,162 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:28,162 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:28,162 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:28,163 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:28,163 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:28,163 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:28,163 INFO L133 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration6_Lasso [2020-07-29 03:25:28,163 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:28,163 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:28,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,359 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-07-29 03:25:28,413 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:28,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,808 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-07-29 03:25:29,215 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:29,215 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,218 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 03:25:29,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:29,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:29,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:29,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:29,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:29,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:29,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,275 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 03:25:29,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:29,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:29,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,305 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 03:25:29,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:29,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:29,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:29,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:29,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:29,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:29,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,359 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 03:25:29,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:29,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:29,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:29,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,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 03:25:29,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:29,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:29,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:29,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,412 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 03:25:29,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:29,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:29,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:29,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,440 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 03:25:29,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:29,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:29,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:29,474 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:29,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:29,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,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 03:25:29,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:29,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:29,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:29,523 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:29,524 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:25:29,525 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,527 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:29,527 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:25:29,528 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:29,528 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1 Supporting invariants [] [2020-07-29 03:25:29,565 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2020-07-29 03:25:29,568 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6;" [2020-07-29 03:25:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:29,575 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 03:25:29,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:29,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:29,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:29,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {1326#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1326#unseeded} is VALID [2020-07-29 03:25:29,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {1326#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {1326#unseeded} is VALID [2020-07-29 03:25:29,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {1326#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1326#unseeded} is VALID [2020-07-29 03:25:29,612 INFO L280 TraceCheckUtils]: 3: Hoare triple {1326#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {1326#unseeded} is VALID [2020-07-29 03:25:29,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {1326#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {1326#unseeded} is VALID [2020-07-29 03:25:29,613 INFO L280 TraceCheckUtils]: 5: Hoare triple {1326#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {1326#unseeded} is VALID [2020-07-29 03:25:29,614 INFO L280 TraceCheckUtils]: 6: Hoare triple {1326#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {1326#unseeded} is VALID [2020-07-29 03:25:29,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {1326#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {1326#unseeded} is VALID [2020-07-29 03:25:29,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {1326#unseeded} assume !(main_~k~0 < main_~array_size~0); {1326#unseeded} is VALID [2020-07-29 03:25:29,616 INFO L280 TraceCheckUtils]: 9: Hoare triple {1326#unseeded} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {1326#unseeded} is VALID [2020-07-29 03:25:29,617 INFO L280 TraceCheckUtils]: 10: Hoare triple {1326#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {1326#unseeded} is VALID [2020-07-29 03:25:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:29,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:29,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:29,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {1329#(>= oldRank0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1399#(and (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) |ULTIMATE.start_test_fun_#t~mem3|))} is VALID [2020-07-29 03:25:29,653 INFO L280 TraceCheckUtils]: 1: Hoare triple {1399#(and (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) |ULTIMATE.start_test_fun_#t~mem3|))} assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; {1364#(or (and (> oldRank0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:29,653 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 03:25:29,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:29,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:29,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:29,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,662 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 03:25:29,663 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 40 transitions. cyclomatic complexity: 17 Second operand 3 states. [2020-07-29 03:25:29,722 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 40 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 50 states and 67 transitions. Complement of second has 7 states. [2020-07-29 03:25:29,722 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 03:25:29,722 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:29,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. cyclomatic complexity: 17 [2020-07-29 03:25:29,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:29,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:29,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:29,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:29,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:29,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:29,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions. [2020-07-29 03:25:29,724 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:29,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:29,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:29,725 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 40 transitions. cyclomatic complexity: 17 [2020-07-29 03:25:29,725 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:29,725 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:29,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:29,726 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:29,726 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 67 transitions. cyclomatic complexity: 25 [2020-07-29 03:25:29,727 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:29,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:29,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:29,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:29,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:29,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:29,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:29,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:29,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:29,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:29,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:25:29,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:25:29,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:25:29,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:25:29,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:25:29,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:25:29,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:29,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:29,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:29,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:29,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:29,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:29,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:29,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:29,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:29,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:29,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:29,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:29,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:29,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:29,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:29,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:29,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:29,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:29,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:29,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:29,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:29,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:29,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:29,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:29,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:29,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:29,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:29,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:29,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:29,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 67 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:29,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,737 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 03:25:29,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:29,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:29,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:29,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:29,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 67 transitions. cyclomatic complexity: 25 [2020-07-29 03:25:29,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:29,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 56 transitions. [2020-07-29 03:25:29,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:29,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 03:25:29,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 56 transitions. [2020-07-29 03:25:29,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:29,743 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 56 transitions. [2020-07-29 03:25:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 56 transitions. [2020-07-29 03:25:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2020-07-29 03:25:29,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:29,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 56 transitions. Second operand 30 states. [2020-07-29 03:25:29,751 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 56 transitions. Second operand 30 states. [2020-07-29 03:25:29,751 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand 30 states. [2020-07-29 03:25:29,754 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:29,755 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2020-07-29 03:25:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2020-07-29 03:25:29,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:29,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:29,758 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 41 states and 56 transitions. [2020-07-29 03:25:29,758 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 41 states and 56 transitions. [2020-07-29 03:25:29,759 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:29,761 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2020-07-29 03:25:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2020-07-29 03:25:29,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:29,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:29,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:29,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 03:25:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2020-07-29 03:25:29,764 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2020-07-29 03:25:29,765 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2020-07-29 03:25:29,765 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:25:29,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 42 transitions. [2020-07-29 03:25:29,766 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:29,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:29,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:29,766 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:29,766 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:29,767 INFO L794 eck$LassoCheckResult]: Stem: 1486#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1483#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 1484#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1487#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 1480#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 1481#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 1491#L535-3 assume !(main_~k~0 < main_~array_size~0); 1490#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 1470#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 1472#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1465#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1477#L522-2 [2020-07-29 03:25:29,767 INFO L796 eck$LassoCheckResult]: Loop: 1477#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1476#L522 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 1477#L522-2 [2020-07-29 03:25:29,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:29,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383699, now seen corresponding path program 1 times [2020-07-29 03:25:29,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:29,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272958228] [2020-07-29 03:25:29,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:29,820 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:29,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2020-07-29 03:25:29,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:29,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014708575] [2020-07-29 03:25:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,834 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:29,840 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:29,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:29,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762584, now seen corresponding path program 1 times [2020-07-29 03:25:29,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:29,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909705237] [2020-07-29 03:25:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:29,895 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:30,176 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2020-07-29 03:25:30,297 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:30,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:30,298 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:30,298 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:30,298 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:30,298 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:30,298 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:30,298 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:30,299 INFO L133 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration7_Lasso [2020-07-29 03:25:30,299 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:30,299 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:30,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,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 03:25:30,529 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-07-29 03:25:30,614 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:30,615 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:30,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:30,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:31,563 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:31,563 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:31,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 03:25:31,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:31,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:31,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:31,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:31,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:31,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:31,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:31,598 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 03:25:31,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:31,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:31,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:31,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:31,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:31,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:31,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:31,642 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 03:25:31,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:31,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:31,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:31,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:31,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:31,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:31,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:31,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:31,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:31,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:31,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:31,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:31,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:31,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:31,704 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:31,720 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 03:25:31,720 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:31,724 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:31,725 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:31,726 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:31,726 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0.base) ULTIMATE.start_main_~numbers~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0.base) ULTIMATE.start_main_~numbers~0.offset)_1 Supporting invariants [] [2020-07-29 03:25:31,770 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2020-07-29 03:25:31,777 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10;" [2020-07-29 03:25:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:31,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 03:25:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:31,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:25:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:31,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:31,866 INFO L280 TraceCheckUtils]: 0: Hoare triple {1663#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1663#unseeded} is VALID [2020-07-29 03:25:31,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {1663#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {1663#unseeded} is VALID [2020-07-29 03:25:31,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {1663#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1663#unseeded} is VALID [2020-07-29 03:25:31,868 INFO L280 TraceCheckUtils]: 3: Hoare triple {1663#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {1663#unseeded} is VALID [2020-07-29 03:25:31,869 INFO L280 TraceCheckUtils]: 4: Hoare triple {1663#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {1663#unseeded} is VALID [2020-07-29 03:25:31,869 INFO L280 TraceCheckUtils]: 5: Hoare triple {1663#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {1663#unseeded} is VALID [2020-07-29 03:25:31,870 INFO L280 TraceCheckUtils]: 6: Hoare triple {1663#unseeded} assume !(main_~k~0 < main_~array_size~0); {1663#unseeded} is VALID [2020-07-29 03:25:31,870 INFO L280 TraceCheckUtils]: 7: Hoare triple {1663#unseeded} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {1743#(and (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= 0 ULTIMATE.start_test_fun_~i~0) (= ULTIMATE.start_main_~numbers~0.offset ULTIMATE.start_test_fun_~a.offset) unseeded)} is VALID [2020-07-29 03:25:31,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {1743#(and (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= 0 ULTIMATE.start_test_fun_~i~0) (= ULTIMATE.start_main_~numbers~0.offset ULTIMATE.start_test_fun_~a.offset) unseeded)} assume !!(test_fun_~i~0 < test_fun_~N); {1743#(and (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= 0 ULTIMATE.start_test_fun_~i~0) (= ULTIMATE.start_main_~numbers~0.offset ULTIMATE.start_test_fun_~a.offset) unseeded)} is VALID [2020-07-29 03:25:31,871 INFO L280 TraceCheckUtils]: 9: Hoare triple {1743#(and (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= 0 ULTIMATE.start_test_fun_~i~0) (= ULTIMATE.start_main_~numbers~0.offset ULTIMATE.start_test_fun_~a.offset) unseeded)} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1743#(and (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= 0 ULTIMATE.start_test_fun_~i~0) (= ULTIMATE.start_main_~numbers~0.offset ULTIMATE.start_test_fun_~a.offset) unseeded)} is VALID [2020-07-29 03:25:31,872 INFO L280 TraceCheckUtils]: 10: Hoare triple {1743#(and (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= 0 ULTIMATE.start_test_fun_~i~0) (= ULTIMATE.start_main_~numbers~0.offset ULTIMATE.start_test_fun_~a.offset) unseeded)} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {1713#(and (= (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset) ULTIMATE.start_main_~numbers~0.offset) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) unseeded)} is VALID [2020-07-29 03:25:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:31,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:25:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:31,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:31,917 INFO L280 TraceCheckUtils]: 0: Hoare triple {1714#(and (= (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset) ULTIMATE.start_main_~numbers~0.offset) (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) ULTIMATE.start_main_~numbers~0.offset)) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base))} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1753#(and (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) ULTIMATE.start_main_~numbers~0.offset) oldRank0) (= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset) ULTIMATE.start_main_~numbers~0.offset) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))))} is VALID [2020-07-29 03:25:31,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {1753#(and (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) ULTIMATE.start_main_~numbers~0.offset) oldRank0) (= (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset) ULTIMATE.start_main_~numbers~0.offset) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))))} assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; {1716#(and (= (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset) ULTIMATE.start_main_~numbers~0.offset) (or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) ULTIMATE.start_main_~numbers~0.offset))) unseeded) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base))} is VALID [2020-07-29 03:25:31,920 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 03:25:31,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:31,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:31,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:31,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:31,937 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:25:31,937 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 42 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-07-29 03:25:32,054 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 42 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 39 states and 53 transitions. Complement of second has 8 states. [2020-07-29 03:25:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:32,055 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:32,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 42 transitions. cyclomatic complexity: 18 [2020-07-29 03:25:32,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:32,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:32,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:25:32,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:32,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:32,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:32,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2020-07-29 03:25:32,058 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:32,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:32,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:32,058 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 42 transitions. cyclomatic complexity: 18 [2020-07-29 03:25:32,059 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:32,059 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:25:32,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:32,060 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:32,060 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 53 transitions. cyclomatic complexity: 22 [2020-07-29 03:25:32,060 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:32,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:32,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:32,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:32,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:32,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:32,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:32,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:32,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:32,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:32,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 39 letters. Loop has 39 letters. [2020-07-29 03:25:32,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 39 letters. Loop has 39 letters. [2020-07-29 03:25:32,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 39 letters. Loop has 39 letters. [2020-07-29 03:25:32,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:32,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:32,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:32,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:32,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:32,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:32,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:32,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:32,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:32,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:32,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:32,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:32,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:32,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:32,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:32,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:32,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:32,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:32,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:32,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:32,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:32,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:32,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:32,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:32,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:32,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:32,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:32,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:32,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:32,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:32,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 42 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:32,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:32,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 53 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:32,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,078 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:25:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-07-29 03:25:32,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:32,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:32,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:32,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:32,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. cyclomatic complexity: 22 [2020-07-29 03:25:32,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:32,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 39 transitions. [2020-07-29 03:25:32,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:25:32,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:25:32,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2020-07-29 03:25:32,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:32,083 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-29 03:25:32,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2020-07-29 03:25:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-07-29 03:25:32,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:32,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 39 transitions. Second operand 25 states. [2020-07-29 03:25:32,085 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 39 transitions. Second operand 25 states. [2020-07-29 03:25:32,086 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 25 states. [2020-07-29 03:25:32,086 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:32,088 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-29 03:25:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-07-29 03:25:32,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:32,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:32,089 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 30 states and 39 transitions. [2020-07-29 03:25:32,089 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 30 states and 39 transitions. [2020-07-29 03:25:32,090 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:32,091 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-29 03:25:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-07-29 03:25:32,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:32,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:32,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:32,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 03:25:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-07-29 03:25:32,093 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 03:25:32,094 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 03:25:32,094 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:25:32,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-07-29 03:25:32,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:32,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:32,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:32,095 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:32,095 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:32,095 INFO L794 eck$LassoCheckResult]: Stem: 1827#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1823#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 1824#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1830#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 1825#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 1817#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 1818#L535-3 assume !(main_~k~0 < main_~array_size~0); 1826#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 1815#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 1816#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1831#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1822#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1832#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 1809#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 1810#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 1811#L518-3 [2020-07-29 03:25:32,096 INFO L796 eck$LassoCheckResult]: Loop: 1811#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1812#L518-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 1811#L518-3 [2020-07-29 03:25:32,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:32,096 INFO L82 PathProgramCache]: Analyzing trace with hash 562957404, now seen corresponding path program 3 times [2020-07-29 03:25:32,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:32,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504039964] [2020-07-29 03:25:32,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:32,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1972#true} is VALID [2020-07-29 03:25:32,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {1972#true} is VALID [2020-07-29 03:25:32,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1972#true} is VALID [2020-07-29 03:25:32,199 INFO L280 TraceCheckUtils]: 3: Hoare triple {1972#true} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {1974#(= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:32,200 INFO L280 TraceCheckUtils]: 4: Hoare triple {1974#(= 0 ULTIMATE.start_main_~k~0)} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {1974#(= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:32,200 INFO L280 TraceCheckUtils]: 5: Hoare triple {1974#(= 0 ULTIMATE.start_main_~k~0)} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {1975#(<= ULTIMATE.start_main_~k~0 1)} is VALID [2020-07-29 03:25:32,201 INFO L280 TraceCheckUtils]: 6: Hoare triple {1975#(<= ULTIMATE.start_main_~k~0 1)} assume !(main_~k~0 < main_~array_size~0); {1976#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:25:32,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {1976#(<= ULTIMATE.start_main_~array_size~0 1)} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,202 INFO L280 TraceCheckUtils]: 8: Hoare triple {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} assume !!(test_fun_~i~0 < test_fun_~N); {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,203 INFO L280 TraceCheckUtils]: 9: Hoare triple {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,204 INFO L280 TraceCheckUtils]: 10: Hoare triple {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,204 INFO L280 TraceCheckUtils]: 11: Hoare triple {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,205 INFO L280 TraceCheckUtils]: 12: Hoare triple {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,206 INFO L280 TraceCheckUtils]: 13: Hoare triple {1977#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {1978#(<= ULTIMATE.start_test_fun_~N ULTIMATE.start_test_fun_~i~0)} is VALID [2020-07-29 03:25:32,207 INFO L280 TraceCheckUtils]: 14: Hoare triple {1978#(<= ULTIMATE.start_test_fun_~N ULTIMATE.start_test_fun_~i~0)} assume !!(test_fun_~i~0 < test_fun_~N); {1973#false} is VALID [2020-07-29 03:25:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:32,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504039964] [2020-07-29 03:25:32,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697597824] [2020-07-29 03:25:32,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:32,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-29 03:25:32,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:32,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:25:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:32,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:32,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {1972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1972#true} is VALID [2020-07-29 03:25:32,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {1972#true} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {1972#true} is VALID [2020-07-29 03:25:32,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {1972#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1972#true} is VALID [2020-07-29 03:25:32,415 INFO L280 TraceCheckUtils]: 3: Hoare triple {1972#true} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {1991#(<= ULTIMATE.start_main_~k~0 0)} is VALID [2020-07-29 03:25:32,416 INFO L280 TraceCheckUtils]: 4: Hoare triple {1991#(<= ULTIMATE.start_main_~k~0 0)} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {1991#(<= ULTIMATE.start_main_~k~0 0)} is VALID [2020-07-29 03:25:32,416 INFO L280 TraceCheckUtils]: 5: Hoare triple {1991#(<= ULTIMATE.start_main_~k~0 0)} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {1975#(<= ULTIMATE.start_main_~k~0 1)} is VALID [2020-07-29 03:25:32,420 INFO L280 TraceCheckUtils]: 6: Hoare triple {1975#(<= ULTIMATE.start_main_~k~0 1)} assume !(main_~k~0 < main_~array_size~0); {1976#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:25:32,424 INFO L280 TraceCheckUtils]: 7: Hoare triple {1976#(<= ULTIMATE.start_main_~array_size~0 1)} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,425 INFO L280 TraceCheckUtils]: 8: Hoare triple {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} assume !!(test_fun_~i~0 < test_fun_~N); {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,426 INFO L280 TraceCheckUtils]: 9: Hoare triple {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,426 INFO L280 TraceCheckUtils]: 10: Hoare triple {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,427 INFO L280 TraceCheckUtils]: 11: Hoare triple {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,428 INFO L280 TraceCheckUtils]: 12: Hoare triple {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,431 INFO L280 TraceCheckUtils]: 13: Hoare triple {2004#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {2023#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 1 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:32,432 INFO L280 TraceCheckUtils]: 14: Hoare triple {2023#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 1 ULTIMATE.start_test_fun_~i~0))} assume !!(test_fun_~i~0 < test_fun_~N); {1973#false} is VALID [2020-07-29 03:25:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:32,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:32,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-29 03:25:32,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345463474] [2020-07-29 03:25:32,434 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:32,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:32,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2020-07-29 03:25:32,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:32,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371865088] [2020-07-29 03:25:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:32,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:32,442 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:32,444 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:32,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 03:25:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-29 03:25:32,485 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 14 Second operand 10 states. [2020-07-29 03:25:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:32,810 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-07-29 03:25:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:25:32,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:25:32,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:32,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 54 transitions. [2020-07-29 03:25:32,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:32,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 28 states and 35 transitions. [2020-07-29 03:25:32,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:25:32,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 03:25:32,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2020-07-29 03:25:32,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:32,858 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-29 03:25:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2020-07-29 03:25:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-29 03:25:32,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:32,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 35 transitions. Second operand 27 states. [2020-07-29 03:25:32,861 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 35 transitions. Second operand 27 states. [2020-07-29 03:25:32,861 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 27 states. [2020-07-29 03:25:32,861 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:32,862 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-29 03:25:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-29 03:25:32,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:32,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:32,863 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states and 35 transitions. [2020-07-29 03:25:32,863 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states and 35 transitions. [2020-07-29 03:25:32,864 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:32,865 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-29 03:25:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-29 03:25:32,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:32,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:32,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:32,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 03:25:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-07-29 03:25:32,867 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-29 03:25:32,867 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-29 03:25:32,867 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:25:32,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-07-29 03:25:32,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:32,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:32,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:32,869 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:32,869 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:32,869 INFO L794 eck$LassoCheckResult]: Stem: 2098#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2095#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 2096#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2101#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 2093#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 2087#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 2088#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 2094#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 2104#L535-3 assume !(main_~k~0 < main_~array_size~0); 2097#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 2085#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 2086#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 2105#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 2092#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 2103#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 2083#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 2084#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 2079#L518-3 [2020-07-29 03:25:32,869 INFO L796 eck$LassoCheckResult]: Loop: 2079#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 2080#L518-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 2079#L518-3 [2020-07-29 03:25:32,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:32,870 INFO L82 PathProgramCache]: Analyzing trace with hash 131132986, now seen corresponding path program 4 times [2020-07-29 03:25:32,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:32,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669817607] [2020-07-29 03:25:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:32,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:32,894 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:32,898 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 4 times [2020-07-29 03:25:32,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:32,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17594565] [2020-07-29 03:25:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:32,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:32,906 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:32,907 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:32,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:32,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1464749119, now seen corresponding path program 1 times [2020-07-29 03:25:32,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:32,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238072204] [2020-07-29 03:25:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:32,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:32,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:32,937 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:33,327 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 101 [2020-07-29 03:25:33,484 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:33,485 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:33,485 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:33,485 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:33,485 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:33,485 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:33,485 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:33,486 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:33,486 INFO L133 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration9_Lasso [2020-07-29 03:25:33,486 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:33,486 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:33,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,721 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2020-07-29 03:25:33,783 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:33,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:33,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:34,219 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-07-29 03:25:34,629 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:34,629 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,632 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 03:25:34,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,660 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 03:25:34,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,685 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 03:25:34,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,712 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 03:25:34,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:34,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,763 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 03:25:34,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,769 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:34,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,797 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,819 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 03:25:34,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,828 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,850 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 03:25:34,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:34,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:34,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:34,853 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 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:34,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,876 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:34,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:34,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,914 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 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,936 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 03:25:34,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,957 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 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:34,979 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 03:25:34,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:34,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:34,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:34,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:34,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:34,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:34,986 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 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:35,008 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 03:25:35,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:35,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:35,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:35,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:35,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:35,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:35,016 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 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:35,038 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 03:25:35,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:35,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:35,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:35,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:35,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:35,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:35,044 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 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:35,067 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 03:25:35,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:35,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:35,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:35,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:35,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:35,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:35,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:35,072 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:35,073 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:25:35,073 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:35,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:35,075 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:25:35,075 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:35,075 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_3) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_3 Supporting invariants [] [2020-07-29 03:25:35,114 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:35,117 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6;" [2020-07-29 03:25:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,125 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 03:25:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:35,169 INFO L280 TraceCheckUtils]: 0: Hoare triple {2244#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2244#unseeded} is VALID [2020-07-29 03:25:35,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {2244#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {2244#unseeded} is VALID [2020-07-29 03:25:35,170 INFO L280 TraceCheckUtils]: 2: Hoare triple {2244#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {2244#unseeded} is VALID [2020-07-29 03:25:35,171 INFO L280 TraceCheckUtils]: 3: Hoare triple {2244#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {2244#unseeded} is VALID [2020-07-29 03:25:35,173 INFO L280 TraceCheckUtils]: 4: Hoare triple {2244#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2244#unseeded} is VALID [2020-07-29 03:25:35,173 INFO L280 TraceCheckUtils]: 5: Hoare triple {2244#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2244#unseeded} is VALID [2020-07-29 03:25:35,174 INFO L280 TraceCheckUtils]: 6: Hoare triple {2244#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2244#unseeded} is VALID [2020-07-29 03:25:35,174 INFO L280 TraceCheckUtils]: 7: Hoare triple {2244#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2244#unseeded} is VALID [2020-07-29 03:25:35,175 INFO L280 TraceCheckUtils]: 8: Hoare triple {2244#unseeded} assume !(main_~k~0 < main_~array_size~0); {2244#unseeded} is VALID [2020-07-29 03:25:35,175 INFO L280 TraceCheckUtils]: 9: Hoare triple {2244#unseeded} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {2244#unseeded} is VALID [2020-07-29 03:25:35,175 INFO L280 TraceCheckUtils]: 10: Hoare triple {2244#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2244#unseeded} is VALID [2020-07-29 03:25:35,181 INFO L280 TraceCheckUtils]: 11: Hoare triple {2244#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2244#unseeded} is VALID [2020-07-29 03:25:35,182 INFO L280 TraceCheckUtils]: 12: Hoare triple {2244#unseeded} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {2244#unseeded} is VALID [2020-07-29 03:25:35,186 INFO L280 TraceCheckUtils]: 13: Hoare triple {2244#unseeded} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2244#unseeded} is VALID [2020-07-29 03:25:35,188 INFO L280 TraceCheckUtils]: 14: Hoare triple {2244#unseeded} assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; {2244#unseeded} is VALID [2020-07-29 03:25:35,188 INFO L280 TraceCheckUtils]: 15: Hoare triple {2244#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {2244#unseeded} is VALID [2020-07-29 03:25:35,189 INFO L280 TraceCheckUtils]: 16: Hoare triple {2244#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2244#unseeded} is VALID [2020-07-29 03:25:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:35,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {2247#(>= oldRank0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2340#(and (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) |ULTIMATE.start_test_fun_#t~mem3|))} is VALID [2020-07-29 03:25:35,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {2340#(and (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) |ULTIMATE.start_test_fun_#t~mem3|))} assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; {2287#(or (and (> oldRank0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:35,224 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 03:25:35,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:35,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:35,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,235 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 03:25:35,235 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 03:25:35,307 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 37 states and 45 transitions. Complement of second has 7 states. [2020-07-29 03:25:35,307 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 03:25:35,307 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:35,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 03:25:35,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:35,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 45 transitions. [2020-07-29 03:25:35,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:35,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,310 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 03:25:35,311 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:35,311 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:35,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,312 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:35,312 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 45 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:35,312 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:35,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:35,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:35,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:35,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:35,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:35,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:35,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,329 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 03:25:35,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,331 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:25:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:35,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {2244#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2244#unseeded} is VALID [2020-07-29 03:25:35,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {2244#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {2244#unseeded} is VALID [2020-07-29 03:25:35,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {2244#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {2244#unseeded} is VALID [2020-07-29 03:25:35,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {2244#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {2244#unseeded} is VALID [2020-07-29 03:25:35,378 INFO L280 TraceCheckUtils]: 4: Hoare triple {2244#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2244#unseeded} is VALID [2020-07-29 03:25:35,379 INFO L280 TraceCheckUtils]: 5: Hoare triple {2244#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2244#unseeded} is VALID [2020-07-29 03:25:35,379 INFO L280 TraceCheckUtils]: 6: Hoare triple {2244#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2244#unseeded} is VALID [2020-07-29 03:25:35,380 INFO L280 TraceCheckUtils]: 7: Hoare triple {2244#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2244#unseeded} is VALID [2020-07-29 03:25:35,380 INFO L280 TraceCheckUtils]: 8: Hoare triple {2244#unseeded} assume !(main_~k~0 < main_~array_size~0); {2244#unseeded} is VALID [2020-07-29 03:25:35,380 INFO L280 TraceCheckUtils]: 9: Hoare triple {2244#unseeded} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {2244#unseeded} is VALID [2020-07-29 03:25:35,381 INFO L280 TraceCheckUtils]: 10: Hoare triple {2244#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2244#unseeded} is VALID [2020-07-29 03:25:35,381 INFO L280 TraceCheckUtils]: 11: Hoare triple {2244#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2244#unseeded} is VALID [2020-07-29 03:25:35,381 INFO L280 TraceCheckUtils]: 12: Hoare triple {2244#unseeded} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {2244#unseeded} is VALID [2020-07-29 03:25:35,382 INFO L280 TraceCheckUtils]: 13: Hoare triple {2244#unseeded} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2244#unseeded} is VALID [2020-07-29 03:25:35,383 INFO L280 TraceCheckUtils]: 14: Hoare triple {2244#unseeded} assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; {2244#unseeded} is VALID [2020-07-29 03:25:35,383 INFO L280 TraceCheckUtils]: 15: Hoare triple {2244#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {2244#unseeded} is VALID [2020-07-29 03:25:35,383 INFO L280 TraceCheckUtils]: 16: Hoare triple {2244#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2244#unseeded} is VALID [2020-07-29 03:25:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:35,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {2247#(>= oldRank0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2443#(and (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) |ULTIMATE.start_test_fun_#t~mem3|))} is VALID [2020-07-29 03:25:35,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {2443#(and (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) |ULTIMATE.start_test_fun_#t~mem3|))} assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; {2287#(or (and (> oldRank0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:35,417 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 03:25:35,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:35,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:35,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,427 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:25:35,427 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 03:25:35,481 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 37 states and 45 transitions. Complement of second has 7 states. [2020-07-29 03:25:35,482 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 03:25:35,482 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:35,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 03:25:35,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:35,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 45 transitions. [2020-07-29 03:25:35,483 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:35,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,484 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 03:25:35,484 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:35,484 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:35,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,485 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:35,485 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 45 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:35,486 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:35,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:35,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:35,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:35,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:35,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:35,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:35,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,496 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 03:25:35,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,497 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:25:35,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:35,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {2244#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2244#unseeded} is VALID [2020-07-29 03:25:35,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {2244#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {2244#unseeded} is VALID [2020-07-29 03:25:35,546 INFO L280 TraceCheckUtils]: 2: Hoare triple {2244#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {2244#unseeded} is VALID [2020-07-29 03:25:35,547 INFO L280 TraceCheckUtils]: 3: Hoare triple {2244#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {2244#unseeded} is VALID [2020-07-29 03:25:35,547 INFO L280 TraceCheckUtils]: 4: Hoare triple {2244#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2244#unseeded} is VALID [2020-07-29 03:25:35,548 INFO L280 TraceCheckUtils]: 5: Hoare triple {2244#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2244#unseeded} is VALID [2020-07-29 03:25:35,548 INFO L280 TraceCheckUtils]: 6: Hoare triple {2244#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2244#unseeded} is VALID [2020-07-29 03:25:35,548 INFO L280 TraceCheckUtils]: 7: Hoare triple {2244#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2244#unseeded} is VALID [2020-07-29 03:25:35,549 INFO L280 TraceCheckUtils]: 8: Hoare triple {2244#unseeded} assume !(main_~k~0 < main_~array_size~0); {2244#unseeded} is VALID [2020-07-29 03:25:35,549 INFO L280 TraceCheckUtils]: 9: Hoare triple {2244#unseeded} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {2244#unseeded} is VALID [2020-07-29 03:25:35,550 INFO L280 TraceCheckUtils]: 10: Hoare triple {2244#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2244#unseeded} is VALID [2020-07-29 03:25:35,550 INFO L280 TraceCheckUtils]: 11: Hoare triple {2244#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2244#unseeded} is VALID [2020-07-29 03:25:35,550 INFO L280 TraceCheckUtils]: 12: Hoare triple {2244#unseeded} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {2244#unseeded} is VALID [2020-07-29 03:25:35,551 INFO L280 TraceCheckUtils]: 13: Hoare triple {2244#unseeded} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2244#unseeded} is VALID [2020-07-29 03:25:35,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {2244#unseeded} assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; {2244#unseeded} is VALID [2020-07-29 03:25:35,552 INFO L280 TraceCheckUtils]: 15: Hoare triple {2244#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {2244#unseeded} is VALID [2020-07-29 03:25:35,552 INFO L280 TraceCheckUtils]: 16: Hoare triple {2244#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2244#unseeded} is VALID [2020-07-29 03:25:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:35,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {2247#(>= oldRank0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2546#(and (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) |ULTIMATE.start_test_fun_#t~mem3|))} is VALID [2020-07-29 03:25:35,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {2546#(and (<= 0 (+ (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) |ULTIMATE.start_test_fun_#t~mem3|))} assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; {2287#(or (and (> oldRank0 (* (- 1) (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:35,590 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 03:25:35,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:35,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:35,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,599 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:25:35,600 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 03:25:35,685 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 48 states and 59 transitions. Complement of second has 6 states. [2020-07-29 03:25:35,685 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 03:25:35,686 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:35,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 03:25:35,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:35,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 59 transitions. [2020-07-29 03:25:35,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,688 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 03:25:35,688 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:35,688 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:35,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,689 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:35,689 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 59 transitions. cyclomatic complexity: 17 [2020-07-29 03:25:35,689 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:35,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:35,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:35,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:35,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:25:35,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:25:35,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:25:35,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:35,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:35,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 27 letters. Loop has 27 letters. [2020-07-29 03:25:35,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:35,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:35,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:35,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:35,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:35,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:35,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:35,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:35,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:35,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 59 transitions. cyclomatic complexity: 17 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:35,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,698 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-07-29 03:25:35,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:35,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:35,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:25:35,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:35,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. cyclomatic complexity: 17 [2020-07-29 03:25:35,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 48 transitions. [2020-07-29 03:25:35,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:25:35,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:25:35,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2020-07-29 03:25:35,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:35,702 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2020-07-29 03:25:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2020-07-29 03:25:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2020-07-29 03:25:35,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:35,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 48 transitions. Second operand 30 states. [2020-07-29 03:25:35,705 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 48 transitions. Second operand 30 states. [2020-07-29 03:25:35,705 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 30 states. [2020-07-29 03:25:35,705 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:35,706 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-07-29 03:25:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2020-07-29 03:25:35,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:35,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:35,707 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 38 states and 48 transitions. [2020-07-29 03:25:35,707 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 38 states and 48 transitions. [2020-07-29 03:25:35,708 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:35,709 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2020-07-29 03:25:35,709 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2020-07-29 03:25:35,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:35,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:35,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:35,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 03:25:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2020-07-29 03:25:35,710 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-07-29 03:25:35,710 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2020-07-29 03:25:35,711 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 03:25:35,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2020-07-29 03:25:35,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:35,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,711 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:35,712 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:35,712 INFO L794 eck$LassoCheckResult]: Stem: 2627#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2623#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 2624#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2631#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 2625#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 2617#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 2618#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 2626#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 2634#L535-3 assume !(main_~k~0 < main_~array_size~0); 2628#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 2615#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 2610#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 2612#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 2622#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 2635#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 2613#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 2614#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 2607#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 2609#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 2620#L522-2 [2020-07-29 03:25:35,712 INFO L796 eck$LassoCheckResult]: Loop: 2620#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 2619#L522 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 2620#L522-2 [2020-07-29 03:25:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1464749117, now seen corresponding path program 5 times [2020-07-29 03:25:35,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131006217] [2020-07-29 03:25:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,724 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:35,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2020-07-29 03:25:35,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588032120] [2020-07-29 03:25:35,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,744 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:35,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1125370110, now seen corresponding path program 1 times [2020-07-29 03:25:35,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525993399] [2020-07-29 03:25:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,767 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,770 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:36,267 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 108 [2020-07-29 03:25:36,431 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-07-29 03:25:36,434 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:36,434 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:36,434 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:36,434 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:36,434 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:36,434 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:36,435 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:36,435 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:36,435 INFO L133 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration10_Lasso [2020-07-29 03:25:36,435 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:36,435 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:36,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,715 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-07-29 03:25:36,795 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:36,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:36,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:37,660 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:37,660 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,663 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 03:25:37,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:37,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:37,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:37,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:37,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:37,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:37,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:37,667 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 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,691 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 03:25:37,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:37,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:37,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:37,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:37,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:37,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:37,699 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 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,756 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 03:25:37,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:37,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:37,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:37,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:37,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:37,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:37,763 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 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,795 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 03:25:37,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:37,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:37,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:37,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:37,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:37,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:37,800 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 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,824 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 03:25:37,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:37,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:37,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:37,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:37,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:37,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:37,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,854 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 03:25:37,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:37,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:37,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:37,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:37,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:37,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:37,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:37,857 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 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,881 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 03:25:37,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:37,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:37,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:37,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:37,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:37,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:37,887 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 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,910 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 03:25:37,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:37,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:37,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:37,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:37,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:37,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:37,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:37,913 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 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,936 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 03:25:37,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:37,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:37,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:37,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:37,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:37,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:37,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:37,940 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 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,963 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 03:25:37,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:37,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:37,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:37,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:37,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:37,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:37,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:37,967 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 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:37,989 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 03:25:37,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:37,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:37,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:37,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:37,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:37,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:37,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:37,992 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 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,021 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 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,044 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 03:25:38,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,047 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 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,070 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 03:25:38,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:38,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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:38,115 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 03:25:38,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:38,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:38,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,159 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:38,167 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 03:25:38,168 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:38,171 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,174 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:38,174 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:38,174 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_5 Supporting invariants [] [2020-07-29 03:25:38,220 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2020-07-29 03:25:38,224 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10;" [2020-07-29 03:25:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,229 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 03:25:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:38,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {2801#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2801#unseeded} is VALID [2020-07-29 03:25:38,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {2801#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {2801#unseeded} is VALID [2020-07-29 03:25:38,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {2801#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {2801#unseeded} is VALID [2020-07-29 03:25:38,284 INFO L280 TraceCheckUtils]: 3: Hoare triple {2801#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {2801#unseeded} is VALID [2020-07-29 03:25:38,285 INFO L280 TraceCheckUtils]: 4: Hoare triple {2801#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2801#unseeded} is VALID [2020-07-29 03:25:38,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {2801#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2801#unseeded} is VALID [2020-07-29 03:25:38,286 INFO L280 TraceCheckUtils]: 6: Hoare triple {2801#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2801#unseeded} is VALID [2020-07-29 03:25:38,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {2801#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2801#unseeded} is VALID [2020-07-29 03:25:38,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {2801#unseeded} assume !(main_~k~0 < main_~array_size~0); {2801#unseeded} is VALID [2020-07-29 03:25:38,287 INFO L280 TraceCheckUtils]: 9: Hoare triple {2801#unseeded} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {2801#unseeded} is VALID [2020-07-29 03:25:38,288 INFO L280 TraceCheckUtils]: 10: Hoare triple {2801#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2801#unseeded} is VALID [2020-07-29 03:25:38,288 INFO L280 TraceCheckUtils]: 11: Hoare triple {2801#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2801#unseeded} is VALID [2020-07-29 03:25:38,288 INFO L280 TraceCheckUtils]: 12: Hoare triple {2801#unseeded} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {2801#unseeded} is VALID [2020-07-29 03:25:38,289 INFO L280 TraceCheckUtils]: 13: Hoare triple {2801#unseeded} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2801#unseeded} is VALID [2020-07-29 03:25:38,289 INFO L280 TraceCheckUtils]: 14: Hoare triple {2801#unseeded} assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; {2801#unseeded} is VALID [2020-07-29 03:25:38,290 INFO L280 TraceCheckUtils]: 15: Hoare triple {2801#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {2801#unseeded} is VALID [2020-07-29 03:25:38,290 INFO L280 TraceCheckUtils]: 16: Hoare triple {2801#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2801#unseeded} is VALID [2020-07-29 03:25:38,290 INFO L280 TraceCheckUtils]: 17: Hoare triple {2801#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2801#unseeded} is VALID [2020-07-29 03:25:38,291 INFO L280 TraceCheckUtils]: 18: Hoare triple {2801#unseeded} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {2801#unseeded} is VALID [2020-07-29 03:25:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:38,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {2804#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)))} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2913#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))))} is VALID [2020-07-29 03:25:38,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {2913#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))))} assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; {2854#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:38,323 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 03:25:38,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:38,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:38,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,335 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 03:25:38,336 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-07-29 03:25:38,386 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 34 states and 42 transitions. Complement of second has 7 states. [2020-07-29 03:25:38,386 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 03:25:38,387 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:38,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:38,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:38,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:38,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:38,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:38,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:38,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:38,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2020-07-29 03:25:38,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:38,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:38,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:38,389 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 38 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:38,390 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:38,390 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:38,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:38,391 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:38,391 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 42 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:38,391 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:38,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:38,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:38,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:38,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:38,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:38,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:38,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:38,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:38,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:38,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,400 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 03:25:38,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,401 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:25:38,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:38,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {2801#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2801#unseeded} is VALID [2020-07-29 03:25:38,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {2801#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {2801#unseeded} is VALID [2020-07-29 03:25:38,452 INFO L280 TraceCheckUtils]: 2: Hoare triple {2801#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {2801#unseeded} is VALID [2020-07-29 03:25:38,453 INFO L280 TraceCheckUtils]: 3: Hoare triple {2801#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {2801#unseeded} is VALID [2020-07-29 03:25:38,453 INFO L280 TraceCheckUtils]: 4: Hoare triple {2801#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2801#unseeded} is VALID [2020-07-29 03:25:38,455 INFO L280 TraceCheckUtils]: 5: Hoare triple {2801#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2801#unseeded} is VALID [2020-07-29 03:25:38,458 INFO L280 TraceCheckUtils]: 6: Hoare triple {2801#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2801#unseeded} is VALID [2020-07-29 03:25:38,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {2801#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2801#unseeded} is VALID [2020-07-29 03:25:38,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {2801#unseeded} assume !(main_~k~0 < main_~array_size~0); {2801#unseeded} is VALID [2020-07-29 03:25:38,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {2801#unseeded} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {2801#unseeded} is VALID [2020-07-29 03:25:38,460 INFO L280 TraceCheckUtils]: 10: Hoare triple {2801#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2801#unseeded} is VALID [2020-07-29 03:25:38,461 INFO L280 TraceCheckUtils]: 11: Hoare triple {2801#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2801#unseeded} is VALID [2020-07-29 03:25:38,461 INFO L280 TraceCheckUtils]: 12: Hoare triple {2801#unseeded} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {2801#unseeded} is VALID [2020-07-29 03:25:38,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {2801#unseeded} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2801#unseeded} is VALID [2020-07-29 03:25:38,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {2801#unseeded} assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; {2801#unseeded} is VALID [2020-07-29 03:25:38,462 INFO L280 TraceCheckUtils]: 15: Hoare triple {2801#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {2801#unseeded} is VALID [2020-07-29 03:25:38,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {2801#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2801#unseeded} is VALID [2020-07-29 03:25:38,463 INFO L280 TraceCheckUtils]: 17: Hoare triple {2801#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2801#unseeded} is VALID [2020-07-29 03:25:38,468 INFO L280 TraceCheckUtils]: 18: Hoare triple {2801#unseeded} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {2801#unseeded} is VALID [2020-07-29 03:25:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:38,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {2804#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)))} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {3019#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))))} is VALID [2020-07-29 03:25:38,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {3019#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))))} assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; {2854#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:38,501 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 03:25:38,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:38,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:38,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,514 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:25:38,514 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-07-29 03:25:38,553 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 34 states and 42 transitions. Complement of second has 7 states. [2020-07-29 03:25:38,553 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 03:25:38,553 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:38,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:38,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:38,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:38,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:38,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:38,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:38,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:38,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2020-07-29 03:25:38,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:38,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:38,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:38,556 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 38 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:38,556 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:38,556 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:38,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:38,557 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:38,557 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 42 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:38,557 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:38,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:38,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:38,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:38,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:38,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:38,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:38,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:38,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:38,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:38,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 42 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,564 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 03:25:38,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,565 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:25:38,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:38,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {2801#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2801#unseeded} is VALID [2020-07-29 03:25:38,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {2801#unseeded} havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; {2801#unseeded} is VALID [2020-07-29 03:25:38,614 INFO L280 TraceCheckUtils]: 2: Hoare triple {2801#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {2801#unseeded} is VALID [2020-07-29 03:25:38,615 INFO L280 TraceCheckUtils]: 3: Hoare triple {2801#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; {2801#unseeded} is VALID [2020-07-29 03:25:38,615 INFO L280 TraceCheckUtils]: 4: Hoare triple {2801#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2801#unseeded} is VALID [2020-07-29 03:25:38,615 INFO L280 TraceCheckUtils]: 5: Hoare triple {2801#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2801#unseeded} is VALID [2020-07-29 03:25:38,616 INFO L280 TraceCheckUtils]: 6: Hoare triple {2801#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; {2801#unseeded} is VALID [2020-07-29 03:25:38,616 INFO L280 TraceCheckUtils]: 7: Hoare triple {2801#unseeded} main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; {2801#unseeded} is VALID [2020-07-29 03:25:38,617 INFO L280 TraceCheckUtils]: 8: Hoare triple {2801#unseeded} assume !(main_~k~0 < main_~array_size~0); {2801#unseeded} is VALID [2020-07-29 03:25:38,617 INFO L280 TraceCheckUtils]: 9: Hoare triple {2801#unseeded} test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; {2801#unseeded} is VALID [2020-07-29 03:25:38,617 INFO L280 TraceCheckUtils]: 10: Hoare triple {2801#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2801#unseeded} is VALID [2020-07-29 03:25:38,618 INFO L280 TraceCheckUtils]: 11: Hoare triple {2801#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2801#unseeded} is VALID [2020-07-29 03:25:38,619 INFO L280 TraceCheckUtils]: 12: Hoare triple {2801#unseeded} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {2801#unseeded} is VALID [2020-07-29 03:25:38,619 INFO L280 TraceCheckUtils]: 13: Hoare triple {2801#unseeded} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2801#unseeded} is VALID [2020-07-29 03:25:38,619 INFO L280 TraceCheckUtils]: 14: Hoare triple {2801#unseeded} assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; {2801#unseeded} is VALID [2020-07-29 03:25:38,620 INFO L280 TraceCheckUtils]: 15: Hoare triple {2801#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {2801#unseeded} is VALID [2020-07-29 03:25:38,620 INFO L280 TraceCheckUtils]: 16: Hoare triple {2801#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {2801#unseeded} is VALID [2020-07-29 03:25:38,621 INFO L280 TraceCheckUtils]: 17: Hoare triple {2801#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {2801#unseeded} is VALID [2020-07-29 03:25:38,621 INFO L280 TraceCheckUtils]: 18: Hoare triple {2801#unseeded} assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; {2801#unseeded} is VALID [2020-07-29 03:25:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:38,652 INFO L280 TraceCheckUtils]: 0: Hoare triple {2804#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)))} call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {3125#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))))} is VALID [2020-07-29 03:25:38,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {3125#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem7| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))))} assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; {2854#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:38,654 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 03:25:38,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:38,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:38,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,664 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:25:38,664 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-07-29 03:25:38,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 36 states and 46 transitions. Complement of second has 6 states. [2020-07-29 03:25:38,714 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 03:25:38,715 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:38,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:38,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:38,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:38,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:38,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:38,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:38,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:38,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2020-07-29 03:25:38,716 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:38,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:38,717 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 38 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:38,717 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:38,717 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:38,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:38,717 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:38,717 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 46 transitions. cyclomatic complexity: 16 [2020-07-29 03:25:38,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. cyclomatic complexity: 16 [2020-07-29 03:25:38,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:38,718 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:25:38,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 46 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 46 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 36 letters. Loop has 36 letters. [2020-07-29 03:25:38,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 03:25:38,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 46 transitions. cyclomatic complexity: 16 Stem has 36 letters. Loop has 36 letters. [2020-07-29 03:25:38,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:38,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:38,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 46 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 30 letters. [2020-07-29 03:25:38,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:38,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:38,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 46 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:38,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 46 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:38,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 46 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 38 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 46 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:38,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,723 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-29 03:25:38,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:38,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:38,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:25:38,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:38,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. cyclomatic complexity: 16 [2020-07-29 03:25:38,726 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:38,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2020-07-29 03:25:38,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:25:38,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:25:38,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:25:38,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:38,727 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:38,727 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:38,727 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:38,727 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 03:25:38,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:25:38,727 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:38,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:38,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:25:38 BoogieIcfgContainer [2020-07-29 03:25:38,734 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:25:38,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:25:38,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:25:38,735 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:25:38,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:16" (3/4) ... [2020-07-29 03:25:38,739 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:25:38,739 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:25:38,741 INFO L168 Benchmark]: Toolchain (without parser) took 23465.45 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 501.2 MB). Free memory was 954.9 MB in the beginning and 1.3 GB in the end (delta: -323.5 MB). Peak memory consumption was 177.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:38,741 INFO L168 Benchmark]: CDTParser took 0.26 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 03:25:38,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:38,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:38,742 INFO L168 Benchmark]: Boogie Preprocessor took 31.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:38,742 INFO L168 Benchmark]: RCFGBuilder took 456.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:38,743 INFO L168 Benchmark]: BuchiAutomizer took 22278.18 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -194.1 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:38,743 INFO L168 Benchmark]: Witness Printer took 4.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:38,745 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.26 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 638.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 456.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22278.18 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -194.1 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.67 ms. Allocated memory is still 1.5 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (2 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * k + array_size and consists of 5 locations. One deterministic module has affine ranking function -1 * a + -4 * i + 1 and consists of 8 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[numbers][numbers + k * 4 + -4] and consists of 8 locations. One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + i * 4] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[numbers][numbers] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + i * 4] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.2s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 17.8s. Construction of modules took 0.5s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 56 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 4. Nontrivial modules had stage [6, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 156 SDtfs, 231 SDslu, 113 SDs, 0 SdLazy, 286 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital171 mio100 ax110 hnf98 lsp81 ukn80 mio100 lsp59 div100 bol100 ite100 ukn100 eq173 hnf90 smp89 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...