./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/array01-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/array01-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 c01598788c0e593641b4d52eb46aec8832108f2ffb3b67e30286093c8a1926f8 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 20:26:13,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 20:26:13,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 20:26:13,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 20:26:13,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 20:26:13,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 20:26:13,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 20:26:13,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 20:26:13,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 20:26:13,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 20:26:13,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 20:26:13,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 20:26:13,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 20:26:13,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 20:26:13,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 20:26:13,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 20:26:13,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 20:26:13,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 20:26:13,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 20:26:13,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 20:26:13,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 20:26:13,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 20:26:13,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 20:26:13,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 20:26:13,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 20:26:13,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 20:26:13,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 20:26:13,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 20:26:13,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 20:26:13,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 20:26:13,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 20:26:13,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 20:26:13,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 20:26:13,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 20:26:13,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 20:26:13,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 20:26:13,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 20:26:13,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 20:26:13,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 20:26:13,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 20:26:13,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 20:26:13,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-19 20:26:13,489 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 20:26:13,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 20:26:13,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 20:26:13,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 20:26:13,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 20:26:13,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 20:26:13,491 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 20:26:13,491 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 20:26:13,491 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 20:26:13,491 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 20:26:13,491 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 20:26:13,491 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 20:26:13,492 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 20:26:13,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 20:26:13,492 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 20:26:13,492 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 20:26:13,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 20:26:13,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 20:26:13,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 20:26:13,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 20:26:13,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 20:26:13,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 20:26:13,494 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 20:26:13,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 20:26:13,494 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 20:26:13,494 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 20:26:13,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 20:26:13,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 20:26:13,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 20:26:13,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 20:26:13,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 20:26:13,495 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 20:26:13,496 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 20:26:13,496 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> c01598788c0e593641b4d52eb46aec8832108f2ffb3b67e30286093c8a1926f8 [2021-12-19 20:26:13,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 20:26:13,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 20:26:13,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 20:26:13,729 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 20:26:13,729 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 20:26:13,730 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2021-12-19 20:26:13,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d0d8c9e/59c611d8307f4bcb8b62324b606402a6/FLAG8e2238bd6 [2021-12-19 20:26:14,185 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 20:26:14,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2021-12-19 20:26:14,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d0d8c9e/59c611d8307f4bcb8b62324b606402a6/FLAG8e2238bd6 [2021-12-19 20:26:14,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d0d8c9e/59c611d8307f4bcb8b62324b606402a6 [2021-12-19 20:26:14,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 20:26:14,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 20:26:14,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 20:26:14,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 20:26:14,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 20:26:14,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31933344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14, skipping insertion in model container [2021-12-19 20:26:14,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 20:26:14,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 20:26:14,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 20:26:14,494 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 20:26:14,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 20:26:14,544 INFO L208 MainTranslator]: Completed translation [2021-12-19 20:26:14,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14 WrapperNode [2021-12-19 20:26:14,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 20:26:14,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 20:26:14,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 20:26:14,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 20:26:14,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,588 INFO L137 Inliner]: procedures = 116, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2021-12-19 20:26:14,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 20:26:14,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 20:26:14,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 20:26:14,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 20:26:14,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 20:26:14,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 20:26:14,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 20:26:14,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 20:26:14,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14" (1/1) ... [2021-12-19 20:26:14,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:14,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:14,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:14,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-19 20:26:14,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-19 20:26:14,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-19 20:26:14,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 20:26:14,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 20:26:14,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 20:26:14,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 20:26:14,782 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 20:26:14,783 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 20:26:14,882 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 20:26:14,887 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 20:26:14,887 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-19 20:26:14,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:26:14 BoogieIcfgContainer [2021-12-19 20:26:14,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 20:26:14,890 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 20:26:14,890 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 20:26:14,893 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 20:26:14,894 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:26:14,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 08:26:14" (1/3) ... [2021-12-19 20:26:14,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5481d7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 08:26:14, skipping insertion in model container [2021-12-19 20:26:14,895 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:26:14,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:26:14" (2/3) ... [2021-12-19 20:26:14,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5481d7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 08:26:14, skipping insertion in model container [2021-12-19 20:26:14,895 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:26:14,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:26:14" (3/3) ... [2021-12-19 20:26:14,897 INFO L388 chiAutomizerObserver]: Analyzing ICFG array01-alloca-2.i [2021-12-19 20:26:14,932 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 20:26:14,933 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 20:26:14,933 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 20:26:14,933 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 20:26:14,933 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 20:26:14,934 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 20:26:14,934 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 20:26:14,934 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 20:26:14,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:14,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-19 20:26:14,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:14,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:14,963 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 20:26:14,964 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:14,964 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 20:26:14,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:14,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-19 20:26:14,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:14,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:14,966 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 20:26:14,966 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:14,972 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 12#L526true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4#L526-2true call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 5#L531-3true [2021-12-19 20:26:14,972 INFO L793 eck$LassoCheckResult]: Loop: 5#L531-3true assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 13#L531-2true main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5#L531-3true [2021-12-19 20:26:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:14,976 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-19 20:26:14,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:14,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217499259] [2021-12-19 20:26:14,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:14,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:15,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:15,135 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-12-19 20:26:15,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:15,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668076170] [2021-12-19 20:26:15,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:15,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:15,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:15,183 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:15,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:15,188 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-12-19 20:26:15,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:15,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828938105] [2021-12-19 20:26:15,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:15,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:15,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:15,252 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:15,530 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:26:15,530 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:26:15,530 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:26:15,531 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:26:15,531 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:26:15,531 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:15,531 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:26:15,532 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:26:15,532 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration1_Lasso [2021-12-19 20:26:15,532 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:26:15,532 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:26:15,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:15,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:15,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:15,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:15,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:15,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:15,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:15,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:15,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:15,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:15,924 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:26:15,928 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:26:15,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:15,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:15,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:15,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:15,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-19 20:26:15,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:15,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:15,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:15,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:15,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:15,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:15,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:15,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:15,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:15,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:15,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:15,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:15,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:16,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:16,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:16,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:16,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:16,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-19 20:26:16,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:16,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:16,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:16,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:16,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:16,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:16,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:16,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:16,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:16,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:16,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:16,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:16,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:16,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:16,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:16,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-19 20:26:16,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:16,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:16,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:16,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:16,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:16,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-19 20:26:16,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:16,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:16,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:16,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:16,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:16,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:16,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:16,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:16,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:16,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:16,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:16,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:16,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-19 20:26:16,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:16,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:16,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:16,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:16,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:16,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:16,192 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:16,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:16,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:16,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:16,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:16,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:16,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-19 20:26:16,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:16,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:16,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:16,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:16,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:16,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:16,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:16,272 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:26:16,298 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-19 20:26:16,298 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-19 20:26:16,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:16,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:16,307 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:16,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:26:16,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-19 20:26:16,336 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:26:16,336 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:26:16,337 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2021-12-19 20:26:16,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:16,371 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-12-19 20:26:16,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:16,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 20:26:16,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:16,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:16,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:26:16,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:16,499 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 [2021-12-19 20:26:16,500 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:16,538 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 53 transitions. Complement of second has 7 states. [2021-12-19 20:26:16,539 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 [2021-12-19 20:26:16,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2021-12-19 20:26:16,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-19 20:26:16,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:16,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-19 20:26:16,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:16,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-19 20:26:16,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:16,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2021-12-19 20:26:16,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:26:16,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2021-12-19 20:26:16,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:26:16,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-19 20:26:16,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2021-12-19 20:26:16,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:26:16,553 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-19 20:26:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2021-12-19 20:26:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-19 20:26:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-12-19 20:26:16,571 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-19 20:26:16,572 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-12-19 20:26:16,572 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 20:26:16,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-12-19 20:26:16,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:26:16,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:16,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:16,573 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 20:26:16,573 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:26:16,573 INFO L791 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 118#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 116#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 111#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 112#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 114#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 119#L516-3 [2021-12-19 20:26:16,574 INFO L793 eck$LassoCheckResult]: Loop: 119#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 120#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 122#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 121#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 119#L516-3 [2021-12-19 20:26:16,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-12-19 20:26:16,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:16,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045986154] [2021-12-19 20:26:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:16,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:16,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:26:16,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045986154] [2021-12-19 20:26:16,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045986154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:26:16,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 20:26:16,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 20:26:16,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93816560] [2021-12-19 20:26:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:26:16,620 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:26:16,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:16,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2021-12-19 20:26:16,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:16,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462532091] [2021-12-19 20:26:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:16,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:16,626 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:16,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:16,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:26:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 20:26:16,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 20:26:16,674 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:26:16,691 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2021-12-19 20:26:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 20:26:16,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2021-12-19 20:26:16,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:26:16,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2021-12-19 20:26:16,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:26:16,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-19 20:26:16,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2021-12-19 20:26:16,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:26:16,694 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-19 20:26:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2021-12-19 20:26:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-12-19 20:26:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2021-12-19 20:26:16,695 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-19 20:26:16,696 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-12-19 20:26:16,696 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 20:26:16,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2021-12-19 20:26:16,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:26:16,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:16,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:16,697 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:16,697 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:26:16,697 INFO L791 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 150#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 143#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 144#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 145#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 146#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 147#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 151#L516-3 [2021-12-19 20:26:16,697 INFO L793 eck$LassoCheckResult]: Loop: 151#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 152#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 154#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 153#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 151#L516-3 [2021-12-19 20:26:16,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-12-19 20:26:16,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:16,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233044384] [2021-12-19 20:26:16,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:16,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:16,710 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:16,721 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:16,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2021-12-19 20:26:16,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:16,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363059899] [2021-12-19 20:26:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:16,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:16,725 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:16,729 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:16,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2021-12-19 20:26:16,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:16,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099692564] [2021-12-19 20:26:16,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:16,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:16,740 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:16,753 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:17,061 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:26:17,061 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:26:17,061 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:26:17,061 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:26:17,061 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:26:17,062 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,062 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:26:17,062 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:26:17,062 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration3_Lasso [2021-12-19 20:26:17,062 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:26:17,062 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:26:17,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:17,527 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:26:17,528 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:26:17,528 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,531 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:17,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-19 20:26:17,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:17,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:17,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:17,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:17,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:17,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:17,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:17,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:17,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:17,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:17,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,560 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:17,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-19 20:26:17,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:17,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:17,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:17,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:17,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:17,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:17,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:17,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:17,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:17,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,608 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:17,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-19 20:26:17,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:17,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:17,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:17,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:17,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:17,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:17,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:17,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:17,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:17,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,677 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:17,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-19 20:26:17,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:17,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:17,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:17,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:17,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:17,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:17,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:17,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:17,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:17,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:17,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,720 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:17,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:17,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:17,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:17,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:17,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:17,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:17,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:17,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-19 20:26:17,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:17,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-19 20:26:17,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,768 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:17,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-19 20:26:17,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:17,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:17,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:17,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:17,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:17,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:17,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:17,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:17,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:17,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,796 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:17,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-19 20:26:17,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:17,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:17,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:17,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:17,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:17,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:17,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:17,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:17,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:17,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:17,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,835 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:17,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-19 20:26:17,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:17,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:17,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:17,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:17,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:17,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:17,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:17,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:17,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-19 20:26:17,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,871 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:17,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-19 20:26:17,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:17,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:17,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:17,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:17,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:17,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:17,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:17,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:17,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:17,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:17,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,901 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:17,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-19 20:26:17,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:17,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:17,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:17,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:17,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:17,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:17,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:17,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:17,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-19 20:26:17,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,932 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:17,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-19 20:26:17,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:17,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:17,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:17,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:17,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:17,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:17,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:17,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:26:17,989 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2021-12-19 20:26:17,989 INFO L444 ModelExtractionUtils]: 9 out of 37 variables were initially zero. Simplification set additionally 24 variables to zero. [2021-12-19 20:26:17,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:17,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:17,992 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:18,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-19 20:26:18,032 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:26:18,041 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-19 20:26:18,041 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:26:18,042 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_test_fun_~a#1.base)_1, ULTIMATE.start_test_fun_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_test_fun_~a#1.base)_1 - 4*ULTIMATE.start_test_fun_~i~0#1 Supporting invariants [1*ULTIMATE.start_test_fun_~a#1.offset >= 0] [2021-12-19 20:26:18,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:18,068 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2021-12-19 20:26:18,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:18,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 20:26:18,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:18,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 20:26:18,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:18,244 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 [2021-12-19 20:26:18,244 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:18,271 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 23 transitions. Complement of second has 7 states. [2021-12-19 20:26:18,283 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 [2021-12-19 20:26:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2021-12-19 20:26:18,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2021-12-19 20:26:18,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:18,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2021-12-19 20:26:18,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:18,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2021-12-19 20:26:18,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:18,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2021-12-19 20:26:18,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:18,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 22 transitions. [2021-12-19 20:26:18,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:26:18,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-19 20:26:18,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2021-12-19 20:26:18,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:18,286 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2021-12-19 20:26:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2021-12-19 20:26:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2021-12-19 20:26:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2021-12-19 20:26:18,287 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-19 20:26:18,287 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-12-19 20:26:18,288 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 20:26:18,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2021-12-19 20:26:18,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:18,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:18,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:18,288 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:18,288 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:18,289 INFO L791 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 271#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 264#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 265#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 266#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 267#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 268#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 272#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 274#L517-3 [2021-12-19 20:26:18,289 INFO L793 eck$LassoCheckResult]: Loop: 274#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 277#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 274#L517-3 [2021-12-19 20:26:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2021-12-19 20:26:18,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:18,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656291428] [2021-12-19 20:26:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:18,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:18,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:18,336 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2021-12-19 20:26:18,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:18,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116295862] [2021-12-19 20:26:18,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:18,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:18,345 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:18,348 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:18,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2021-12-19 20:26:18,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:18,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806084333] [2021-12-19 20:26:18,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:18,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:18,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:18,373 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:18,388 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:18,664 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:26:18,664 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:26:18,664 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:26:18,664 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:26:18,664 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:26:18,664 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:18,664 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:26:18,665 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:26:18,665 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration4_Lasso [2021-12-19 20:26:18,665 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:26:18,665 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:26:18,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:18,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:19,170 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:26:19,170 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:26:19,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,180 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:19,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:19,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-19 20:26:19,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:19,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,231 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-19 20:26:19,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:19,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:19,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:19,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-19 20:26:19,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,260 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-19 20:26:19,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:19,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:19,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:19,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-19 20:26:19,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,285 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-19 20:26:19,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:19,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:19,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-19 20:26:19,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,313 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-19 20:26:19,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:19,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:19,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:19,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-19 20:26:19,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,365 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:19,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:19,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:19,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-19 20:26:19,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-19 20:26:19,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,415 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-19 20:26:19,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:19,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:19,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:19,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-19 20:26:19,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,443 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-19 20:26:19,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:19,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:19,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:19,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-19 20:26:19,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,468 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-19 20:26:19,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:19,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:19,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-19 20:26:19,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,527 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-19 20:26:19,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:19,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:19,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:19,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:19,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,552 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-19 20:26:19,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:19,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:19,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:19,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-19 20:26:19,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,582 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-19 20:26:19,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:19,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:19,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-19 20:26:19,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,646 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-19 20:26:19,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:19,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:19,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:19,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,704 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:19,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:19,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-19 20:26:19,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:19,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,754 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-19 20:26:19,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:19,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:19,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:19,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-12-19 20:26:19,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,784 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-19 20:26:19,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:19,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:19,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:19,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:19,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:19,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:19,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:19,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:26:19,805 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 20:26:19,805 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-19 20:26:19,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:19,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:19,806 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:19,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-19 20:26:19,809 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:26:19,816 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:26:19,816 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:26:19,816 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) ULTIMATE.start_main_~numbers~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) ULTIMATE.start_main_~numbers~0#1.offset)_1 Supporting invariants [] [2021-12-19 20:26:19,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:19,842 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2021-12-19 20:26:19,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:19,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 20:26:19,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:19,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:19,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:19,959 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 [2021-12-19 20:26:19,959 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:19,995 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 31 transitions. Complement of second has 8 states. [2021-12-19 20:26:19,996 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 [2021-12-19 20:26:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2021-12-19 20:26:19,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2021-12-19 20:26:19,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:19,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2021-12-19 20:26:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2021-12-19 20:26:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:19,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2021-12-19 20:26:19,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:19,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 24 transitions. [2021-12-19 20:26:19,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:26:19,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:26:19,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2021-12-19 20:26:19,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:20,000 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-12-19 20:26:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2021-12-19 20:26:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-12-19 20:26:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2021-12-19 20:26:20,001 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-12-19 20:26:20,002 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-12-19 20:26:20,002 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 20:26:20,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2021-12-19 20:26:20,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:20,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:20,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:20,004 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:20,004 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:20,004 INFO L791 eck$LassoCheckResult]: Stem: 397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 398#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 399#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 392#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 393#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 394#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 395#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 396#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 400#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 401#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 408#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 405#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 402#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 404#L517-3 [2021-12-19 20:26:20,004 INFO L793 eck$LassoCheckResult]: Loop: 404#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 406#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 404#L517-3 [2021-12-19 20:26:20,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2021-12-19 20:26:20,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:20,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744067528] [2021-12-19 20:26:20,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:20,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:20,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:26:20,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744067528] [2021-12-19 20:26:20,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744067528] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:26:20,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047994100] [2021-12-19 20:26:20,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:26:20,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:26:20,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:20,052 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:26:20,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-12-19 20:26:20,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:26:20,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:26:20,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 20:26:20,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:20,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:26:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:20,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047994100] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:26:20,228 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:26:20,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-12-19 20:26:20,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698442701] [2021-12-19 20:26:20,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:26:20,229 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:26:20,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:20,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2021-12-19 20:26:20,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:20,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174835472] [2021-12-19 20:26:20,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:20,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:20,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:20,238 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:20,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:26:20,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-19 20:26:20,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-19 20:26:20,269 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:26:20,350 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2021-12-19 20:26:20,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-19 20:26:20,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2021-12-19 20:26:20,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:20,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2021-12-19 20:26:20,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:26:20,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:26:20,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2021-12-19 20:26:20,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:20,353 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-19 20:26:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2021-12-19 20:26:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-12-19 20:26:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-12-19 20:26:20,354 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-19 20:26:20,354 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-19 20:26:20,354 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 20:26:20,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2021-12-19 20:26:20,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:20,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:20,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:20,355 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:20,355 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:20,356 INFO L791 eck$LassoCheckResult]: Stem: 544#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 546#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 543#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 539#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 540#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 541#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 542#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 557#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 552#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 547#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 548#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 558#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 553#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 549#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 551#L517-3 [2021-12-19 20:26:20,356 INFO L793 eck$LassoCheckResult]: Loop: 551#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 554#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 551#L517-3 [2021-12-19 20:26:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2021-12-19 20:26:20,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:20,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097833265] [2021-12-19 20:26:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:20,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:20,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:20,383 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:20,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:20,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2021-12-19 20:26:20,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:20,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701109796] [2021-12-19 20:26:20,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:20,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:20,387 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:20,390 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:20,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:20,390 INFO L85 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2021-12-19 20:26:20,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:20,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105918659] [2021-12-19 20:26:20,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:20,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:20,408 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:20,442 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:20,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:20,797 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:26:20,797 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:26:20,797 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:26:20,797 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:26:20,797 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:26:20,798 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:20,798 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:26:20,798 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:26:20,798 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration6_Lasso [2021-12-19 20:26:20,798 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:26:20,798 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:26:20,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:20,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:20,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:20,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:20,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:20,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:20,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:21,322 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:26:21,322 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:26:21,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:21,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:21,328 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:21,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-19 20:26:21,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:21,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:21,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:21,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:21,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:21,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:21,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:21,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:21,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-19 20:26:21,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:21,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:21,357 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:21,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-19 20:26:21,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:21,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:21,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:21,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:21,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:21,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:21,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:21,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:21,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-19 20:26:21,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:21,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:21,385 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:21,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-19 20:26:21,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:21,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:21,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:21,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:21,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:21,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:21,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:21,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:21,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:21,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:21,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:21,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:21,409 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:21,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-19 20:26:21,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:21,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:21,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:21,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:21,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:21,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:21,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:21,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:21,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-12-19 20:26:21,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:21,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:21,443 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:21,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-19 20:26:21,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:21,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:21,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:21,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:21,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:21,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:21,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:21,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:21,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:21,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-19 20:26:21,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:21,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:21,476 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:21,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-19 20:26:21,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:21,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:21,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:21,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:21,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:21,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:21,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:21,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:21,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:21,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:21,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:21,534 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:21,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:21,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:21,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:21,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:21,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:21,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:21,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:21,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-19 20:26:21,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:21,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:21,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:21,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:21,603 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:21,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:21,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:21,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:21,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:21,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:21,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:21,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:21,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-19 20:26:21,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:21,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:21,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:21,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:21,663 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:21,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:21,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:21,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:21,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:21,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:21,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:21,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:21,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-19 20:26:21,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:21,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:21,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:21,716 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:21,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-19 20:26:21,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:21,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:21,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:21,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:21,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:21,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:21,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:21,743 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:26:21,749 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 20:26:21,749 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-19 20:26:21,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:21,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:21,751 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:21,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-19 20:26:21,753 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:26:21,780 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:26:21,780 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:26:21,780 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 4))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 4))_1 Supporting invariants [] [2021-12-19 20:26:21,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-19 20:26:21,814 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2021-12-19 20:26:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:21,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 20:26:21,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:21,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:21,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:21,977 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-19 20:26:21,978 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:22,004 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 26 transitions. Complement of second has 4 states. [2021-12-19 20:26:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:22,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:22,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-19 20:26:22,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:22,007 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:22,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 20:26:22,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:22,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:22,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:22,172 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-19 20:26:22,172 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:22,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 26 transitions. Complement of second has 4 states. [2021-12-19 20:26:22,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:22,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-19 20:26:22,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:22,193 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:22,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:22,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 20:26:22,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:22,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:22,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:22,345 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-19 20:26:22,345 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:22,404 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 43 transitions. Complement of second has 10 states. [2021-12-19 20:26:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:26:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2021-12-19 20:26:22,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-19 20:26:22,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:22,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 17 letters. Loop has 2 letters. [2021-12-19 20:26:22,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:22,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 4 letters. [2021-12-19 20:26:22,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:22,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2021-12-19 20:26:22,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:22,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 36 transitions. [2021-12-19 20:26:22,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:26:22,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:26:22,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2021-12-19 20:26:22,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:22,408 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-19 20:26:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2021-12-19 20:26:22,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-12-19 20:26:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-12-19 20:26:22,410 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-19 20:26:22,410 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-19 20:26:22,410 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 20:26:22,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2021-12-19 20:26:22,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:22,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:22,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:22,411 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:22,411 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:22,411 INFO L791 eck$LassoCheckResult]: Stem: 896#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 897#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 898#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 891#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 892#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 893#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 894#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 895#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 911#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 903#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 899#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 900#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 913#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 912#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 901#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 902#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 915#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 904#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 905#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 906#L517-3 [2021-12-19 20:26:22,411 INFO L793 eck$LassoCheckResult]: Loop: 906#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 907#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 906#L517-3 [2021-12-19 20:26:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1359773592, now seen corresponding path program 4 times [2021-12-19 20:26:22,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:22,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689791017] [2021-12-19 20:26:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:22,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:22,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:26:22,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689791017] [2021-12-19 20:26:22,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689791017] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:26:22,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169621781] [2021-12-19 20:26:22,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 20:26:22,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:26:22,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:22,469 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:26:22,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2021-12-19 20:26:22,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 20:26:22,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:26:22,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 20:26:22,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:22,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:22,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:26:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:22,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169621781] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:26:22,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:26:22,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2021-12-19 20:26:22,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285860508] [2021-12-19 20:26:22,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:26:22,677 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:26:22,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:22,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 4 times [2021-12-19 20:26:22,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:22,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935923031] [2021-12-19 20:26:22,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:22,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:22,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:22,685 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:22,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:26:22,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 20:26:22,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-12-19 20:26:22,716 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 10 Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:26:22,797 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2021-12-19 20:26:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-19 20:26:22,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2021-12-19 20:26:22,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:22,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 28 states and 33 transitions. [2021-12-19 20:26:22,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:26:22,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:26:22,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2021-12-19 20:26:22,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:22,799 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-19 20:26:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2021-12-19 20:26:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-19 20:26:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2021-12-19 20:26:22,801 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-19 20:26:22,801 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-19 20:26:22,801 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-19 20:26:22,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2021-12-19 20:26:22,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:22,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:22,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:22,802 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:22,802 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:22,802 INFO L791 eck$LassoCheckResult]: Stem: 1094#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1095#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1096#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1089#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 1090#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1091#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1111#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1097#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1092#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1093#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1110#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 1102#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1098#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1099#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1113#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1112#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1100#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1101#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1115#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1103#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1104#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1106#L517-3 [2021-12-19 20:26:22,802 INFO L793 eck$LassoCheckResult]: Loop: 1106#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1105#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1106#L517-3 [2021-12-19 20:26:22,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:22,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1255193994, now seen corresponding path program 5 times [2021-12-19 20:26:22,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:22,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586575929] [2021-12-19 20:26:22,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:22,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:22,821 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:22,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:22,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 5 times [2021-12-19 20:26:22,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:22,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586195447] [2021-12-19 20:26:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:22,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:22,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:22,843 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:22,844 INFO L85 PathProgramCache]: Analyzing trace with hash 644383099, now seen corresponding path program 2 times [2021-12-19 20:26:22,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:22,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463305832] [2021-12-19 20:26:22,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:22,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:22,865 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:22,888 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:23,413 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:26:23,413 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:26:23,413 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:26:23,413 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:26:23,413 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:26:23,413 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:23,413 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:26:23,413 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:26:23,413 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration8_Lasso [2021-12-19 20:26:23,413 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:26:23,413 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:26:23,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:23,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:24,005 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:26:24,006 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:26:24,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,008 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-19 20:26:24,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:24,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:24,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:24,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-19 20:26:24,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,033 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-19 20:26:24,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:24,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:24,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:24,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-19 20:26:24,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,059 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-19 20:26:24,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:24,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:24,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-19 20:26:24,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,086 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-19 20:26:24,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:24,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:24,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:24,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-19 20:26:24,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,110 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-19 20:26:24,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:24,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:24,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-12-19 20:26:24,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,137 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-19 20:26:24,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:24,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:24,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:24,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-12-19 20:26:24,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,175 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-19 20:26:24,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:24,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:24,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:24,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-12-19 20:26:24,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,199 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-19 20:26:24,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:24,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:24,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:24,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:24,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,224 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-19 20:26:24,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:24,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:24,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:24,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,256 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-19 20:26:24,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:24,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:24,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:24,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-12-19 20:26:24,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,280 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-19 20:26:24,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:24,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:24,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-12-19 20:26:24,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,319 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-19 20:26:24,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:24,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:24,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-12-19 20:26:24,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,358 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-19 20:26:24,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:24,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:24,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:24,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,389 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-19 20:26:24,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:24,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:24,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:24,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-12-19 20:26:24,425 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,426 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-19 20:26:24,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:24,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:24,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:24,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:24,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:24,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:24,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:24,448 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:26:24,455 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-19 20:26:24,455 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:26:24,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:24,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:24,461 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:24,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-19 20:26:24,463 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:26:24,470 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:26:24,470 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:26:24,470 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 8))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 8))_1 Supporting invariants [] [2021-12-19 20:26:24,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-12-19 20:26:24,519 INFO L297 tatePredicateManager]: 18 out of 20 supporting invariants were superfluous and have been removed [2021-12-19 20:26:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:24,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 20:26:24,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:24,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:24,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:24,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:24,767 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 [2021-12-19 20:26:24,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:24,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 34 transitions. Complement of second has 4 states. [2021-12-19 20:26:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:24,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-19 20:26:24,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:24,791 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:24,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 20:26:24,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:24,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:24,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:24,993 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2021-12-19 20:26:24,993 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:25,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 34 transitions. Complement of second has 4 states. [2021-12-19 20:26:25,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:25,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-19 20:26:25,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:25,018 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:25,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:25,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 20:26:25,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:25,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:25,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:25,224 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2021-12-19 20:26:25,224 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:25,282 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 53 transitions. Complement of second has 12 states. [2021-12-19 20:26:25,282 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 [2021-12-19 20:26:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2021-12-19 20:26:25,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-19 20:26:25,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:25,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 23 letters. Loop has 2 letters. [2021-12-19 20:26:25,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:25,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 21 letters. Loop has 4 letters. [2021-12-19 20:26:25,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:25,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2021-12-19 20:26:25,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:25,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 38 states and 46 transitions. [2021-12-19 20:26:25,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:26:25,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:26:25,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2021-12-19 20:26:25,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:25,285 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-12-19 20:26:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2021-12-19 20:26:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2021-12-19 20:26:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-12-19 20:26:25,287 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-19 20:26:25,287 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-19 20:26:25,287 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-19 20:26:25,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2021-12-19 20:26:25,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:25,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:25,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:25,289 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:25,289 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:25,290 INFO L791 eck$LassoCheckResult]: Stem: 1571#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1572#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1573#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1566#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 1567#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1568#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1569#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1570#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1586#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1585#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1584#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 1579#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1574#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1575#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1582#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1578#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1576#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1577#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1596#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1595#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1594#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1593#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1590#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1589#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1587#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1580#L517-3 [2021-12-19 20:26:25,290 INFO L793 eck$LassoCheckResult]: Loop: 1580#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1581#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1580#L517-3 [2021-12-19 20:26:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash 776867019, now seen corresponding path program 6 times [2021-12-19 20:26:25,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:25,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687319531] [2021-12-19 20:26:25,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:25,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:25,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:26:25,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687319531] [2021-12-19 20:26:25,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687319531] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:26:25,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125724550] [2021-12-19 20:26:25,367 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-19 20:26:25,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:26:25,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:25,368 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:26:25,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2021-12-19 20:26:25,421 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-19 20:26:25,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:26:25,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 20:26:25,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:25,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:26:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:25,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125724550] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:26:25,600 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:26:25,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2021-12-19 20:26:25,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135590892] [2021-12-19 20:26:25,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:26:25,600 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:26:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 6 times [2021-12-19 20:26:25,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:25,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434267028] [2021-12-19 20:26:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:25,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:25,607 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:25,610 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:25,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:26:25,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-19 20:26:25,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-19 20:26:25,648 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. cyclomatic complexity: 12 Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:26:25,763 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2021-12-19 20:26:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 20:26:25,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 61 transitions. [2021-12-19 20:26:25,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:25,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 35 states and 41 transitions. [2021-12-19 20:26:25,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:26:25,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:26:25,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2021-12-19 20:26:25,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:25,765 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-12-19 20:26:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2021-12-19 20:26:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-12-19 20:26:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-12-19 20:26:25,767 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-12-19 20:26:25,767 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-12-19 20:26:25,767 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-19 20:26:25,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2021-12-19 20:26:25,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:25,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:25,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:25,768 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:25,768 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:25,768 INFO L791 eck$LassoCheckResult]: Stem: 1829#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1830#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1831#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1824#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 1825#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1826#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1827#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1828#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1832#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1850#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1849#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 1844#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1843#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 1838#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1833#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1834#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1856#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1837#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1835#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1836#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1841#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1852#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1855#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1854#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1848#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 1847#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 1845#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1839#L517-3 [2021-12-19 20:26:25,768 INFO L793 eck$LassoCheckResult]: Loop: 1839#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1840#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1839#L517-3 [2021-12-19 20:26:25,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:25,769 INFO L85 PathProgramCache]: Analyzing trace with hash -914443991, now seen corresponding path program 7 times [2021-12-19 20:26:25,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:25,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951445111] [2021-12-19 20:26:25,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:25,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:25,783 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:25,798 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 7 times [2021-12-19 20:26:25,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:25,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17880432] [2021-12-19 20:26:25,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:25,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:25,802 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:25,805 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:25,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1687621486, now seen corresponding path program 3 times [2021-12-19 20:26:25,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:25,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135613007] [2021-12-19 20:26:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:25,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:25,819 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:25,833 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:26,448 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:26:26,448 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:26:26,448 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:26:26,448 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:26:26,448 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:26:26,448 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:26,448 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:26:26,448 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:26:26,448 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration10_Lasso [2021-12-19 20:26:26,448 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:26:26,448 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:26:26,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:26,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:27,091 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:26:27,092 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:26:27,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:27,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:27,092 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:27,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-19 20:26:27,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:27,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:27,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:27,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:27,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:27,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:27,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:27,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:27,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:27,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:27,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:27,119 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:27,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-19 20:26:27,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:27,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:27,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:27,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:27,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:27,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:27,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:27,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:27,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2021-12-19 20:26:27,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:27,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:27,157 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:27,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-12-19 20:26:27,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:27,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:27,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:27,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:27,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:27,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:27,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:27,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:27,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:27,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:27,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:27,186 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:27,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-19 20:26:27,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:27,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:27,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:27,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:27,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:27,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:27,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:27,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:27,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-12-19 20:26:27,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:27,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:27,215 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:27,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-19 20:26:27,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:27,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:27,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:27,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:27,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:27,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:27,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:27,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:27,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-12-19 20:26:27,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:27,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:27,250 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:27,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-19 20:26:27,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:27,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:27,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:27,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:27,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:27,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:27,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:27,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:27,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-12-19 20:26:27,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:27,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:27,281 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:27,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-19 20:26:27,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:27,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:27,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:27,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:27,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:27,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:27,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:27,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:27,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-12-19 20:26:27,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:27,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:27,310 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:27,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-19 20:26:27,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:27,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:27,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:27,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:27,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:27,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:27,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:27,324 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:26:27,330 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-19 20:26:27,330 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:26:27,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:27,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:27,331 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:27,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-19 20:26:27,333 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:26:27,340 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:26:27,340 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:26:27,340 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 12))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 12))_1 Supporting invariants [] [2021-12-19 20:26:27,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:27,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:27,418 INFO L297 tatePredicateManager]: 31 out of 33 supporting invariants were superfluous and have been removed [2021-12-19 20:26:27,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:27,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 20:26:27,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:27,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:27,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:27,655 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2021-12-19 20:26:27,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:27,678 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 42 transitions. Complement of second has 4 states. [2021-12-19 20:26:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:27,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-19 20:26:27,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:27,679 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:27,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:27,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 20:26:27,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:27,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:27,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:27,917 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2021-12-19 20:26:27,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:27,940 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 42 transitions. Complement of second has 4 states. [2021-12-19 20:26:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:27,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-19 20:26:27,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:27,944 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:27,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:27,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 20:26:27,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:28,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:28,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:28,181 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2021-12-19 20:26:28,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:28,269 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 63 transitions. Complement of second has 14 states. [2021-12-19 20:26:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:26:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2021-12-19 20:26:28,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-19 20:26:28,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:28,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 29 letters. Loop has 2 letters. [2021-12-19 20:26:28,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:28,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 41 transitions. Stem has 27 letters. Loop has 4 letters. [2021-12-19 20:26:28,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:28,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2021-12-19 20:26:28,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:28,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 46 states and 56 transitions. [2021-12-19 20:26:28,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:26:28,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:26:28,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2021-12-19 20:26:28,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:28,273 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-12-19 20:26:28,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2021-12-19 20:26:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2021-12-19 20:26:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2021-12-19 20:26:28,275 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-19 20:26:28,275 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-19 20:26:28,275 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-19 20:26:28,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2021-12-19 20:26:28,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:28,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:28,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:28,278 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:28,278 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:28,278 INFO L791 eck$LassoCheckResult]: Stem: 2447#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2448#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2449#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2446#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 2442#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 2443#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2444#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 2445#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2450#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 2465#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2464#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 2463#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2462#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 2457#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 2451#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2452#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2460#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2479#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 2453#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2454#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2471#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2455#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 2456#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2477#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2476#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2475#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 2474#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2473#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2469#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2468#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 2466#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2458#L517-3 [2021-12-19 20:26:28,279 INFO L793 eck$LassoCheckResult]: Loop: 2458#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2459#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2458#L517-3 [2021-12-19 20:26:28,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1693390338, now seen corresponding path program 8 times [2021-12-19 20:26:28,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:28,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123627971] [2021-12-19 20:26:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:28,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:28,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:26:28,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123627971] [2021-12-19 20:26:28,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123627971] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:26:28,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902468878] [2021-12-19 20:26:28,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:26:28,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:26:28,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:28,373 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:26:28,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2021-12-19 20:26:28,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:26:28,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:26:28,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-19 20:26:28,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:28,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:26:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:28,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902468878] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:26:28,625 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:26:28,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2021-12-19 20:26:28,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024739109] [2021-12-19 20:26:28,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:26:28,626 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:26:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 8 times [2021-12-19 20:26:28,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:28,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638910600] [2021-12-19 20:26:28,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:28,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:28,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:28,641 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:28,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:26:28,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-19 20:26:28,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-12-19 20:26:28,679 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 14 Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:26:28,807 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2021-12-19 20:26:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-19 20:26:28,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 75 transitions. [2021-12-19 20:26:28,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:28,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 42 states and 49 transitions. [2021-12-19 20:26:28,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:26:28,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:26:28,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2021-12-19 20:26:28,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:28,809 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2021-12-19 20:26:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2021-12-19 20:26:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-19 20:26:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.170731707317073) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2021-12-19 20:26:28,810 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-12-19 20:26:28,811 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-12-19 20:26:28,811 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-19 20:26:28,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2021-12-19 20:26:28,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:28,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:28,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:28,812 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:28,812 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:28,812 INFO L791 eck$LassoCheckResult]: Stem: 2765#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2766#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2767#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2764#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 2760#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 2761#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2762#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 2763#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2768#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 2788#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2787#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 2786#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2785#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 2780#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2779#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 2774#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 2769#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2770#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2777#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2773#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 2771#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2772#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2799#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2798#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 2797#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2795#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2794#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2793#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 2792#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2791#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2784#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 2783#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 2781#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2775#L517-3 [2021-12-19 20:26:28,812 INFO L793 eck$LassoCheckResult]: Loop: 2775#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2776#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2775#L517-3 [2021-12-19 20:26:28,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -54505508, now seen corresponding path program 9 times [2021-12-19 20:26:28,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:28,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812971012] [2021-12-19 20:26:28,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:28,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:28,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:28,845 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:28,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:28,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 9 times [2021-12-19 20:26:28,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:28,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097510135] [2021-12-19 20:26:28,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:28,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:28,850 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:28,852 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash -840184479, now seen corresponding path program 4 times [2021-12-19 20:26:28,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:28,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728851041] [2021-12-19 20:26:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:28,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:28,867 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:28,881 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:29,732 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:26:29,732 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:26:29,732 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:26:29,732 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:26:29,732 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:26:29,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:29,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:26:29,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:26:29,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration12_Lasso [2021-12-19 20:26:29,732 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:26:29,732 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:26:29,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:29,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:30,459 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:26:30,459 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:26:30,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:30,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:30,462 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:30,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-19 20:26:30,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:30,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:30,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:30,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:30,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:30,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:30,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:30,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:30,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2021-12-19 20:26:30,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:30,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:30,487 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:30,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-12-19 20:26:30,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:30,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:30,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:30,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:30,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:30,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:30,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:30,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:30,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2021-12-19 20:26:30,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:30,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:30,519 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:30,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-12-19 20:26:30,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:30,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:30,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:30,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:30,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:30,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:30,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:30,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:30,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:30,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:30,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:30,548 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:30,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-12-19 20:26:30,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:30,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:30,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:30,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:30,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:30,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:30,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:30,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:30,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-12-19 20:26:30,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:30,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:30,583 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:30,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2021-12-19 20:26:30,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:30,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:30,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:30,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:30,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:30,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:30,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:30,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:30,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2021-12-19 20:26:30,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:30,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:30,611 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:30,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2021-12-19 20:26:30,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:30,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:30,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:30,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:30,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:30,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:30,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:30,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:30,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2021-12-19 20:26:30,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:30,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:30,639 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:30,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-12-19 20:26:30,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:30,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:30,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:30,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:30,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:30,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:30,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:30,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:30,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2021-12-19 20:26:30,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:30,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:30,674 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:30,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-12-19 20:26:30,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:30,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:30,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:30,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:30,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:30,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:30,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:30,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:30,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-12-19 20:26:30,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:30,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:30,700 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:30,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-12-19 20:26:30,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:30,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:30,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:30,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:30,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:30,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:30,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:30,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:30,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2021-12-19 20:26:30,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:30,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:30,730 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:30,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-12-19 20:26:30,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:30,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:30,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:30,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:30,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:30,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:30,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:30,745 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:26:30,749 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-19 20:26:30,749 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-19 20:26:30,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:30,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:30,750 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:30,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-12-19 20:26:30,752 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:26:30,758 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:26:30,759 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:26:30,759 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 16))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 16))_1 Supporting invariants [] [2021-12-19 20:26:30,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2021-12-19 20:26:30,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:30,885 INFO L297 tatePredicateManager]: 48 out of 50 supporting invariants were superfluous and have been removed [2021-12-19 20:26:30,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:30,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-19 20:26:30,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:31,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:31,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:31,151 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-19 20:26:31,151 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:31,175 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 50 transitions. Complement of second has 4 states. [2021-12-19 20:26:31,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:31,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 33 letters. Loop has 2 letters. [2021-12-19 20:26:31,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:31,176 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:31,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-19 20:26:31,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:31,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:31,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:31,445 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-19 20:26:31,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:31,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 50 transitions. Complement of second has 4 states. [2021-12-19 20:26:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:31,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 33 letters. Loop has 2 letters. [2021-12-19 20:26:31,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:31,472 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:31,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-19 20:26:31,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:31,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:31,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:31,734 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-19 20:26:31,734 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:31,831 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 59 states and 73 transitions. Complement of second has 16 states. [2021-12-19 20:26:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:26:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2021-12-19 20:26:31,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 33 letters. Loop has 2 letters. [2021-12-19 20:26:31,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:31,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 35 letters. Loop has 2 letters. [2021-12-19 20:26:31,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:31,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 33 letters. Loop has 4 letters. [2021-12-19 20:26:31,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:31,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 73 transitions. [2021-12-19 20:26:31,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:31,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 54 states and 66 transitions. [2021-12-19 20:26:31,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:26:31,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:26:31,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2021-12-19 20:26:31,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:31,834 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2021-12-19 20:26:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2021-12-19 20:26:31,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2021-12-19 20:26:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2021-12-19 20:26:31,837 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2021-12-19 20:26:31,837 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2021-12-19 20:26:31,837 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-19 20:26:31,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2021-12-19 20:26:31,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:31,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:31,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:31,838 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:31,838 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:31,838 INFO L791 eck$LassoCheckResult]: Stem: 3540#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3541#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3542#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3539#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 3535#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3536#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3537#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3538#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3543#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3560#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3559#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3558#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3557#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3556#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3555#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 3548#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 3544#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3545#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3579#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3578#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3546#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3547#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3554#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3549#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3550#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3576#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3575#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3574#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3573#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3571#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3570#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3569#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3568#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3567#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3564#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3563#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3561#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3551#L517-3 [2021-12-19 20:26:31,838 INFO L793 eck$LassoCheckResult]: Loop: 3551#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3552#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3551#L517-3 [2021-12-19 20:26:31,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash 36566833, now seen corresponding path program 10 times [2021-12-19 20:26:31,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:31,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430315919] [2021-12-19 20:26:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:31,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:31,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:26:31,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430315919] [2021-12-19 20:26:31,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430315919] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:26:31,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878826077] [2021-12-19 20:26:31,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 20:26:31,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:26:31,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:31,938 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:26:31,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2021-12-19 20:26:31,996 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 20:26:31,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:26:31,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 20:26:31,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:32,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:26:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:32,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878826077] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:26:32,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:26:32,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2021-12-19 20:26:32,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682643915] [2021-12-19 20:26:32,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:26:32,248 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:26:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 10 times [2021-12-19 20:26:32,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:32,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91711249] [2021-12-19 20:26:32,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:32,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:32,256 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:32,259 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:32,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:26:32,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-19 20:26:32,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2021-12-19 20:26:32,296 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 16 Second operand has 23 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:26:32,437 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2021-12-19 20:26:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-19 20:26:32,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 89 transitions. [2021-12-19 20:26:32,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:32,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 49 states and 57 transitions. [2021-12-19 20:26:32,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:26:32,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:26:32,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 57 transitions. [2021-12-19 20:26:32,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:32,439 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2021-12-19 20:26:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 57 transitions. [2021-12-19 20:26:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2021-12-19 20:26:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2021-12-19 20:26:32,441 INFO L704 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2021-12-19 20:26:32,441 INFO L587 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2021-12-19 20:26:32,441 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-19 20:26:32,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 56 transitions. [2021-12-19 20:26:32,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:32,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:32,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:32,442 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:32,442 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:32,442 INFO L791 eck$LassoCheckResult]: Stem: 3918#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3919#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3920#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3917#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 3913#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3914#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3915#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3916#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3921#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3943#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3942#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3941#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3940#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3939#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3938#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 3933#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3932#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 3926#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 3922#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3923#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3930#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3927#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3924#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3925#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3959#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3958#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3957#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3955#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3954#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3953#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3952#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3950#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3949#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3948#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3947#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3946#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3937#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 3936#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 3934#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3928#L517-3 [2021-12-19 20:26:32,442 INFO L793 eck$LassoCheckResult]: Loop: 3928#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3929#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3928#L517-3 [2021-12-19 20:26:32,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:32,443 INFO L85 PathProgramCache]: Analyzing trace with hash -643498353, now seen corresponding path program 11 times [2021-12-19 20:26:32,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:32,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539602898] [2021-12-19 20:26:32,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:32,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:32,459 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:32,473 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:32,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 11 times [2021-12-19 20:26:32,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:32,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370572974] [2021-12-19 20:26:32,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:32,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:32,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:32,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:32,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:32,479 INFO L85 PathProgramCache]: Analyzing trace with hash 73374548, now seen corresponding path program 5 times [2021-12-19 20:26:32,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:32,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502594439] [2021-12-19 20:26:32,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:32,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:32,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:32,508 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:33,994 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:26:33,994 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:26:33,994 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:26:33,994 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:26:33,994 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:26:33,994 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:33,994 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:26:33,994 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:26:33,994 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration14_Lasso [2021-12-19 20:26:33,994 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:26:33,995 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:26:33,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:33,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:34,920 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:26:34,920 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:26:34,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:34,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:34,922 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:34,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-12-19 20:26:34,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:34,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:34,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:34,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:34,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:34,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:34,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:34,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:34,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:34,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:34,945 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:34,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:34,946 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:34,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-12-19 20:26:34,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:34,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:34,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:34,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:34,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:34,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:34,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:34,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:34,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:34,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2021-12-19 20:26:34,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:34,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:34,984 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:34,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-12-19 20:26:34,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:34,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:34,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:34,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:34,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:34,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:34,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:34,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:35,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2021-12-19 20:26:35,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:35,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:35,012 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:35,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-12-19 20:26:35,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:35,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:35,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:35,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:35,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:35,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:35,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:35,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:35,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:35,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2021-12-19 20:26:35,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:35,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:35,037 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:35,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-12-19 20:26:35,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:35,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:35,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:35,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:35,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:35,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:35,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:35,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:35,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2021-12-19 20:26:35,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:35,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:35,063 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:35,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-12-19 20:26:35,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:35,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:35,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:35,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:35,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:35,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:35,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:35,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:35,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2021-12-19 20:26:35,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:35,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:35,089 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:35,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2021-12-19 20:26:35,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:35,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:35,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:35,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:35,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:35,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:35,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:35,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:35,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2021-12-19 20:26:35,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:35,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:35,117 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:35,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2021-12-19 20:26:35,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:35,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:35,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:35,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:35,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:35,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:35,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:35,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:35,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:35,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:35,145 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:35,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2021-12-19 20:26:35,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:35,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:35,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:35,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:35,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:35,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:35,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:35,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:35,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:35,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:35,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:35,214 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:35,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:35,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:35,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:35,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:35,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:35,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:35,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:35,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2021-12-19 20:26:35,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:35,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:35,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:35,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:35,283 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:35,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:35,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:35,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:35,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:35,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:35,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:35,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:35,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-12-19 20:26:35,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:35,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:35,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:35,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:35,335 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:35,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:35,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:35,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:35,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:35,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:35,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:35,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:35,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-12-19 20:26:35,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:35,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:35,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:35,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:35,385 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:35,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:35,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:35,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:35,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:35,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:35,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:35,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:35,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-12-19 20:26:35,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:26:35,419 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-19 20:26:35,419 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-19 20:26:35,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:35,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:35,424 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:35,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-12-19 20:26:35,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:26:35,446 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:26:35,447 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:26:35,447 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 20))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 20))_1 Supporting invariants [] [2021-12-19 20:26:35,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:35,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:35,642 INFO L297 tatePredicateManager]: 69 out of 71 supporting invariants were superfluous and have been removed [2021-12-19 20:26:35,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:35,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-19 20:26:35,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:35,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:35,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:35,977 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2021-12-19 20:26:35,977 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:35,999 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 58 transitions. Complement of second has 4 states. [2021-12-19 20:26:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:36,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 39 letters. Loop has 2 letters. [2021-12-19 20:26:36,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:36,000 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:36,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-19 20:26:36,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:36,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:36,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:36,303 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2021-12-19 20:26:36,303 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:36,335 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 58 transitions. Complement of second has 4 states. [2021-12-19 20:26:36,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:36,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 39 letters. Loop has 2 letters. [2021-12-19 20:26:36,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:36,337 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:36,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:36,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-19 20:26:36,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:36,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:36,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:36,643 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2021-12-19 20:26:36,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:36,770 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 67 states and 83 transitions. Complement of second has 18 states. [2021-12-19 20:26:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:26:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2021-12-19 20:26:36,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 39 letters. Loop has 2 letters. [2021-12-19 20:26:36,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:36,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 41 letters. Loop has 2 letters. [2021-12-19 20:26:36,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:36,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 39 letters. Loop has 4 letters. [2021-12-19 20:26:36,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:36,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 83 transitions. [2021-12-19 20:26:36,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:36,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 62 states and 76 transitions. [2021-12-19 20:26:36,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:26:36,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:26:36,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 76 transitions. [2021-12-19 20:26:36,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:36,773 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 76 transitions. [2021-12-19 20:26:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 76 transitions. [2021-12-19 20:26:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2021-12-19 20:26:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.169811320754717) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2021-12-19 20:26:36,776 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-12-19 20:26:36,776 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2021-12-19 20:26:36,776 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-19 20:26:36,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2021-12-19 20:26:36,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:36,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:36,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:36,777 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:36,777 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:36,777 INFO L791 eck$LassoCheckResult]: Stem: 4866#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4867#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 4868#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4861#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 4862#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 4863#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4864#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 4865#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4869#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 4888#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4887#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 4886#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4885#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 4884#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4883#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 4882#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4881#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 4874#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 4870#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4871#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4912#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4911#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 4872#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4873#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4879#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4875#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 4876#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4909#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4908#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4907#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 4906#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4904#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4903#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4902#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 4901#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4899#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4898#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4897#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 4896#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4895#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4892#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 4891#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 4889#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4877#L517-3 [2021-12-19 20:26:36,777 INFO L793 eck$LassoCheckResult]: Loop: 4877#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4878#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4877#L517-3 [2021-12-19 20:26:36,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:36,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1793463396, now seen corresponding path program 12 times [2021-12-19 20:26:36,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:36,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903081203] [2021-12-19 20:26:36,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:36,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 45 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:36,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:26:36,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903081203] [2021-12-19 20:26:36,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903081203] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:26:36,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921470869] [2021-12-19 20:26:36,909 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-19 20:26:36,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:26:36,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:36,912 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:26:36,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2021-12-19 20:26:37,076 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-12-19 20:26:37,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:26:37,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 20:26:37,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:37,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:26:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:37,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921470869] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:26:37,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:26:37,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2021-12-19 20:26:37,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072544083] [2021-12-19 20:26:37,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:26:37,382 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:26:37,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 12 times [2021-12-19 20:26:37,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:37,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67030327] [2021-12-19 20:26:37,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:37,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:37,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:37,387 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:37,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:26:37,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-19 20:26:37,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2021-12-19 20:26:37,416 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 18 Second operand has 26 states, 25 states have (on average 3.08) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:26:37,650 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2021-12-19 20:26:37,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-19 20:26:37,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 103 transitions. [2021-12-19 20:26:37,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:37,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 56 states and 65 transitions. [2021-12-19 20:26:37,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:26:37,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:26:37,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 65 transitions. [2021-12-19 20:26:37,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:37,652 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 65 transitions. [2021-12-19 20:26:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 65 transitions. [2021-12-19 20:26:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-12-19 20:26:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2021-12-19 20:26:37,654 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-12-19 20:26:37,654 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-12-19 20:26:37,654 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-19 20:26:37,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 64 transitions. [2021-12-19 20:26:37,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:37,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:37,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:37,659 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:37,660 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:37,661 INFO L791 eck$LassoCheckResult]: Stem: 5304#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5306#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5299#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 5300#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 5301#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5302#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 5303#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5307#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 5331#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5330#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 5329#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5328#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 5327#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5326#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 5325#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5324#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 5319#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5318#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 5313#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 5308#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5309#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5316#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5312#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5310#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5311#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5352#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5351#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5350#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5348#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5347#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5346#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5345#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5343#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5342#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5341#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5340#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5338#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5337#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5336#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5335#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5334#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5323#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 5322#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 5320#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5314#L517-3 [2021-12-19 20:26:37,663 INFO L793 eck$LassoCheckResult]: Loop: 5314#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5315#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5314#L517-3 [2021-12-19 20:26:37,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:37,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1162190146, now seen corresponding path program 13 times [2021-12-19 20:26:37,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:37,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532744911] [2021-12-19 20:26:37,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:37,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:37,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:37,714 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 13 times [2021-12-19 20:26:37,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:37,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371804413] [2021-12-19 20:26:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:37,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:37,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:37,721 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:37,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash 173234503, now seen corresponding path program 6 times [2021-12-19 20:26:37,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:37,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770337537] [2021-12-19 20:26:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:37,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:37,744 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:37,762 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:39,532 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:26:39,533 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:26:39,533 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:26:39,533 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:26:39,533 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:26:39,533 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:39,533 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:26:39,533 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:26:39,533 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration16_Lasso [2021-12-19 20:26:39,533 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:26:39,533 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:26:39,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:39,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:40,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:40,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:40,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:40,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:40,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:40,621 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:26:40,621 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:26:40,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,623 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2021-12-19 20:26:40,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:40,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:40,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:40,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:40,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,648 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2021-12-19 20:26:40,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:40,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:40,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:40,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2021-12-19 20:26:40,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,673 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2021-12-19 20:26:40,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:40,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:40,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2021-12-19 20:26:40,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,699 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2021-12-19 20:26:40,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:40,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:40,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2021-12-19 20:26:40,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,725 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2021-12-19 20:26:40,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:40,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:40,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:40,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2021-12-19 20:26:40,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,749 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2021-12-19 20:26:40,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:40,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:40,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:40,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:40,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,774 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2021-12-19 20:26:40,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:40,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:40,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:40,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,801 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2021-12-19 20:26:40,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:40,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:40,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:40,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:40,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,825 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2021-12-19 20:26:40,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:40,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:40,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:40,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2021-12-19 20:26:40,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,850 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2021-12-19 20:26:40,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:40,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:40,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2021-12-19 20:26:40,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,877 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2021-12-19 20:26:40,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:40,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:40,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:40,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2021-12-19 20:26:40,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,902 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2021-12-19 20:26:40,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:40,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:40,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2021-12-19 20:26:40,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,928 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2021-12-19 20:26:40,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:40,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:40,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2021-12-19 20:26:40,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,954 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2021-12-19 20:26:40,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:40,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:40,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:40,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2021-12-19 20:26:40,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:40,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:40,982 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:40,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2021-12-19 20:26:40,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:40,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:40,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:40,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:40,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:40,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:40,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:40,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:41,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2021-12-19 20:26:41,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:41,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:41,011 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:41,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2021-12-19 20:26:41,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:41,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:41,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:41,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:41,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:41,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:41,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:41,027 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:26:41,032 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-19 20:26:41,032 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-12-19 20:26:41,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:41,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:41,033 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:41,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2021-12-19 20:26:41,036 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:26:41,043 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:26:41,043 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:26:41,043 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 24))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 24))_1 Supporting invariants [] [2021-12-19 20:26:41,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2021-12-19 20:26:41,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:41,302 INFO L297 tatePredicateManager]: 94 out of 96 supporting invariants were superfluous and have been removed [2021-12-19 20:26:41,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:41,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-19 20:26:41,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:41,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:41,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:41,651 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2021-12-19 20:26:41,651 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:41,674 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 66 transitions. Complement of second has 4 states. [2021-12-19 20:26:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 45 letters. Loop has 2 letters. [2021-12-19 20:26:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:41,677 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:41,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:41,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-19 20:26:41,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:42,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:42,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:42,069 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2021-12-19 20:26:42,069 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:42,100 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 66 transitions. Complement of second has 4 states. [2021-12-19 20:26:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:42,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 45 letters. Loop has 2 letters. [2021-12-19 20:26:42,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:42,101 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:42,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:42,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-19 20:26:42,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:42,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:42,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:42,439 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2021-12-19 20:26:42,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:42,608 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 75 states and 93 transitions. Complement of second has 20 states. [2021-12-19 20:26:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:26:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2021-12-19 20:26:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 45 letters. Loop has 2 letters. [2021-12-19 20:26:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 47 letters. Loop has 2 letters. [2021-12-19 20:26:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:42,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 59 transitions. Stem has 45 letters. Loop has 4 letters. [2021-12-19 20:26:42,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:42,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 93 transitions. [2021-12-19 20:26:42,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:42,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 86 transitions. [2021-12-19 20:26:42,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:26:42,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:26:42,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 86 transitions. [2021-12-19 20:26:42,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:42,612 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2021-12-19 20:26:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 86 transitions. [2021-12-19 20:26:42,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2021-12-19 20:26:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 59 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2021-12-19 20:26:42,614 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 70 transitions. [2021-12-19 20:26:42,614 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 70 transitions. [2021-12-19 20:26:42,614 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-19 20:26:42,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 70 transitions. [2021-12-19 20:26:42,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:42,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:42,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:42,615 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:42,615 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:42,615 INFO L791 eck$LassoCheckResult]: Stem: 6441#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 6443#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6436#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 6437#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6438#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6439#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6440#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6444#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6465#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6464#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6463#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6462#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6461#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6460#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6459#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6458#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6457#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6456#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 6451#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 6445#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6446#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6494#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6493#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6447#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6448#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6455#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6449#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6450#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6491#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6490#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6489#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6488#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6486#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6485#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6484#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6483#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6481#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6480#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6479#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6478#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6476#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6475#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6474#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6473#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6472#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6469#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6468#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6466#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6453#L517-3 [2021-12-19 20:26:42,616 INFO L793 eck$LassoCheckResult]: Loop: 6453#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6452#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6453#L517-3 [2021-12-19 20:26:42,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1025367657, now seen corresponding path program 14 times [2021-12-19 20:26:42,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:42,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549229470] [2021-12-19 20:26:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:42,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:42,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:26:42,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549229470] [2021-12-19 20:26:42,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549229470] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:26:42,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616443973] [2021-12-19 20:26:42,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:26:42,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:26:42,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:42,801 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:26:42,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2021-12-19 20:26:42,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:26:42,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:26:42,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 20:26:42,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:43,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:26:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:43,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616443973] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:26:43,234 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:26:43,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2021-12-19 20:26:43,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138407112] [2021-12-19 20:26:43,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:26:43,235 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:26:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 14 times [2021-12-19 20:26:43,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:43,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170405684] [2021-12-19 20:26:43,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:43,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:43,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:43,241 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:43,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:26:43,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-19 20:26:43,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2021-12-19 20:26:43,275 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. cyclomatic complexity: 20 Second operand has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:26:43,497 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2021-12-19 20:26:43,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-19 20:26:43,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 117 transitions. [2021-12-19 20:26:43,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:43,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 63 states and 73 transitions. [2021-12-19 20:26:43,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:26:43,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:26:43,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 73 transitions. [2021-12-19 20:26:43,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:43,499 INFO L681 BuchiCegarLoop]: Abstraction has 63 states and 73 transitions. [2021-12-19 20:26:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 73 transitions. [2021-12-19 20:26:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-12-19 20:26:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2021-12-19 20:26:43,501 INFO L704 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-12-19 20:26:43,501 INFO L587 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-12-19 20:26:43,501 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-19 20:26:43,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 72 transitions. [2021-12-19 20:26:43,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:43,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:43,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:43,502 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:43,503 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:43,503 INFO L791 eck$LassoCheckResult]: Stem: 6939#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6940#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 6941#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6934#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 6935#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6936#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6937#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6938#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6942#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6968#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6967#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6966#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6965#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6964#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6963#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6962#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6961#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6960#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6959#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 6954#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6953#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 6948#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 6943#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6944#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6952#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6947#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6945#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6946#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6994#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6993#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6992#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6990#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6989#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6988#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6987#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6985#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6984#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6983#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6982#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6980#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6979#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6978#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6977#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6975#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6974#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6973#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6972#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6971#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6958#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 6957#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 6955#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6950#L517-3 [2021-12-19 20:26:43,503 INFO L793 eck$LassoCheckResult]: Loop: 6950#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6949#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6950#L517-3 [2021-12-19 20:26:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1227033589, now seen corresponding path program 15 times [2021-12-19 20:26:43,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:43,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999381072] [2021-12-19 20:26:43,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:43,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:43,535 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:43,561 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:43,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 15 times [2021-12-19 20:26:43,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:43,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151880561] [2021-12-19 20:26:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:43,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:43,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:43,568 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1936726214, now seen corresponding path program 7 times [2021-12-19 20:26:43,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:43,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823684434] [2021-12-19 20:26:43,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:43,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:43,597 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:43,626 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:46,015 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:26:46,015 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:26:46,015 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:26:46,015 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:26:46,015 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:26:46,015 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:46,015 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:26:46,015 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:26:46,015 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration18_Lasso [2021-12-19 20:26:46,015 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:26:46,015 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:26:46,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:46,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:47,178 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:26:47,178 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:26:47,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,179 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2021-12-19 20:26:47,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2021-12-19 20:26:47,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,210 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2021-12-19 20:26:47,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:47,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:47,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:47,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2021-12-19 20:26:47,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,234 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2021-12-19 20:26:47,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2021-12-19 20:26:47,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,260 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2021-12-19 20:26:47,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2021-12-19 20:26:47,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,294 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2021-12-19 20:26:47,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:47,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:47,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:47,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2021-12-19 20:26:47,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,319 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2021-12-19 20:26:47,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2021-12-19 20:26:47,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,345 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2021-12-19 20:26:47,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:47,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:47,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:47,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2021-12-19 20:26:47,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,369 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2021-12-19 20:26:47,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:47,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,397 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2021-12-19 20:26:47,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:47,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:47,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:47,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2021-12-19 20:26:47,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,423 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2021-12-19 20:26:47,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:47,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:47,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:47,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:47,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,447 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2021-12-19 20:26:47,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:47,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:47,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:47,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2021-12-19 20:26:47,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,471 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2021-12-19 20:26:47,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2021-12-19 20:26:47,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,500 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2021-12-19 20:26:47,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:47,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:47,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:47,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:47,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,525 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2021-12-19 20:26:47,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:47,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:47,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:47,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2021-12-19 20:26:47,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,551 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2021-12-19 20:26:47,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:47,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:47,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:47,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:47,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,577 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2021-12-19 20:26:47,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:47,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,604 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2021-12-19 20:26:47,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:47,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:47,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:47,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2021-12-19 20:26:47,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,629 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2021-12-19 20:26:47,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:47,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:47,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:47,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2021-12-19 20:26:47,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,653 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2021-12-19 20:26:47,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2021-12-19 20:26:47,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,682 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2021-12-19 20:26:47,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:47,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,711 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2021-12-19 20:26:47,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2021-12-19 20:26:47,740 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,741 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2021-12-19 20:26:47,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2021-12-19 20:26:47,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,794 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2021-12-19 20:26:47,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:47,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2021-12-19 20:26:47,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,824 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2021-12-19 20:26:47,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:47,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:47,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:47,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:47,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:47,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:47,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:47,838 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:26:47,844 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-19 20:26:47,844 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-19 20:26:47,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:47,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:47,845 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:47,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2021-12-19 20:26:47,847 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:26:47,853 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:26:47,854 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:26:47,854 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~k~0#1 4) (- 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~k~0#1 4) (- 4)))_1 Supporting invariants [] [2021-12-19 20:26:47,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:48,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:48,173 INFO L297 tatePredicateManager]: 123 out of 125 supporting invariants were superfluous and have been removed [2021-12-19 20:26:48,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:48,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-19 20:26:48,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:48,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:48,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:48,851 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.18 stem predicates 2 loop predicates [2021-12-19 20:26:48,851 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:49,017 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 80 transitions. Complement of second has 13 states. [2021-12-19 20:26:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 11 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2021-12-19 20:26:49,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 30 transitions. Stem has 51 letters. Loop has 2 letters. [2021-12-19 20:26:49,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:49,018 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:49,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:49,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-19 20:26:49,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:49,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:49,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:49,682 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.18 stem predicates 2 loop predicates [2021-12-19 20:26:49,682 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:49,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 68 states and 80 transitions. Complement of second has 13 states. [2021-12-19 20:26:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 11 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2021-12-19 20:26:49,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 30 transitions. Stem has 51 letters. Loop has 2 letters. [2021-12-19 20:26:49,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:49,795 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:49,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-19 20:26:49,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:50,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:50,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:50,405 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.18 stem predicates 2 loop predicates [2021-12-19 20:26:50,405 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:50,846 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 137 states and 174 transitions. Complement of second has 32 states. [2021-12-19 20:26:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 18 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:26:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 91 transitions. [2021-12-19 20:26:50,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 91 transitions. Stem has 51 letters. Loop has 2 letters. [2021-12-19 20:26:50,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:50,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 91 transitions. Stem has 53 letters. Loop has 2 letters. [2021-12-19 20:26:50,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:50,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 91 transitions. Stem has 51 letters. Loop has 4 letters. [2021-12-19 20:26:50,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:50,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 174 transitions. [2021-12-19 20:26:50,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-19 20:26:50,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 132 states and 167 transitions. [2021-12-19 20:26:50,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-19 20:26:50,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-19 20:26:50,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 167 transitions. [2021-12-19 20:26:50,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:50,851 INFO L681 BuchiCegarLoop]: Abstraction has 132 states and 167 transitions. [2021-12-19 20:26:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 167 transitions. [2021-12-19 20:26:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 71. [2021-12-19 20:26:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2021-12-19 20:26:50,854 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 83 transitions. [2021-12-19 20:26:50,854 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 83 transitions. [2021-12-19 20:26:50,854 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-19 20:26:50,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 83 transitions. [2021-12-19 20:26:50,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:50,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:50,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:50,855 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:50,855 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:50,856 INFO L791 eck$LassoCheckResult]: Stem: 8427#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8428#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 8429#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 8422#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 8423#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 8424#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8425#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 8426#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8430#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 8453#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8452#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 8451#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8450#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 8449#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8448#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 8447#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8446#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 8445#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8443#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 8444#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8492#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 8442#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8441#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 8434#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 8431#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8432#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8440#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8435#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8436#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8484#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8483#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8482#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8481#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8479#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8478#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8477#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8476#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8474#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8473#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8472#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8471#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8469#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8468#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8467#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8466#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8464#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8463#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8462#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8461#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8460#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8457#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 8456#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 8454#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8437#L517-3 [2021-12-19 20:26:50,856 INFO L793 eck$LassoCheckResult]: Loop: 8437#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8438#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8437#L517-3 [2021-12-19 20:26:50,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1121113811, now seen corresponding path program 16 times [2021-12-19 20:26:50,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:50,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143684800] [2021-12-19 20:26:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:50,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:50,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:50,889 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:50,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:50,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 16 times [2021-12-19 20:26:50,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:50,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396299743] [2021-12-19 20:26:50,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:50,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:50,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:50,895 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:50,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:50,895 INFO L85 PathProgramCache]: Analyzing trace with hash -646417768, now seen corresponding path program 8 times [2021-12-19 20:26:50,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:50,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588934730] [2021-12-19 20:26:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:50,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:50,921 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:50,944 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:54,851 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:26:54,851 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:26:54,851 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:26:54,851 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:26:54,851 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:26:54,851 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:54,851 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:26:54,851 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:26:54,851 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration19_Lasso [2021-12-19 20:26:54,851 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:26:54,851 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:26:54,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:54,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:55,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:55,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:26:56,153 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:26:56,153 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:26:56,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,155 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2021-12-19 20:26:56,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2021-12-19 20:26:56,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,182 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2021-12-19 20:26:56,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:56,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:56,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:56,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:56,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,205 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2021-12-19 20:26:56,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:56,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,233 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2021-12-19 20:26:56,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:56,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:56,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:56,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2021-12-19 20:26:56,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,257 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2021-12-19 20:26:56,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:56,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:56,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:56,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2021-12-19 20:26:56,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,282 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2021-12-19 20:26:56,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:56,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,308 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2021-12-19 20:26:56,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:56,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:56,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:56,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:56,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,336 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2021-12-19 20:26:56,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:56,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:56,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:56,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:56,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,362 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2021-12-19 20:26:56,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:56,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:56,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:56,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2021-12-19 20:26:56,386 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,387 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2021-12-19 20:26:56,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:56,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:56,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:56,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2021-12-19 20:26:56,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,411 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2021-12-19 20:26:56,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2021-12-19 20:26:56,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,438 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2021-12-19 20:26:56,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2021-12-19 20:26:56,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,464 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2021-12-19 20:26:56,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2021-12-19 20:26:56,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,490 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2021-12-19 20:26:56,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:56,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:56,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:56,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:56,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,526 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2021-12-19 20:26:56,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:26:56,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:26:56,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:26:56,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2021-12-19 20:26:56,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,550 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2021-12-19 20:26:56,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:56,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,579 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2021-12-19 20:26:56,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2021-12-19 20:26:56,604 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,605 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2021-12-19 20:26:56,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2021-12-19 20:26:56,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,634 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2021-12-19 20:26:56,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2021-12-19 20:26:56,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,663 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2021-12-19 20:26:56,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2021-12-19 20:26:56,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,699 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2021-12-19 20:26:56,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:56,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,727 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2021-12-19 20:26:56,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2021-12-19 20:26:56,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,764 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2021-12-19 20:26:56,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:56,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,793 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2021-12-19 20:26:56,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2021-12-19 20:26:56,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,845 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2021-12-19 20:26:56,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:26:56,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2021-12-19 20:26:56,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,872 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2021-12-19 20:26:56,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:26:56,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:26:56,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:26:56,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:26:56,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:26:56,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:26:56,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:26:56,885 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:26:56,892 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-12-19 20:26:56,892 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:26:56,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:26:56,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:56,893 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:26:56,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2021-12-19 20:26:56,895 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:26:56,901 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:26:56,901 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:26:56,901 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 28))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 28))_1 Supporting invariants [] [2021-12-19 20:26:56,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:56,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2021-12-19 20:26:57,289 INFO L297 tatePredicateManager]: 139 out of 141 supporting invariants were superfluous and have been removed [2021-12-19 20:26:57,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:57,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-19 20:26:57,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:57,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:57,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:57,695 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-19 20:26:57,695 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 23 Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:57,719 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 23. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 87 transitions. Complement of second has 4 states. [2021-12-19 20:26:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:57,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 53 letters. Loop has 2 letters. [2021-12-19 20:26:57,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:57,725 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:57,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:57,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-19 20:26:57,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:58,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:58,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:58,112 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-19 20:26:58,112 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 23 Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:58,137 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 23. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 87 transitions. Complement of second has 4 states. [2021-12-19 20:26:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:26:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:26:58,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 53 letters. Loop has 2 letters. [2021-12-19 20:26:58,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:58,138 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:26:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:58,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-19 20:26:58,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:58,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:26:58,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:58,537 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2021-12-19 20:26:58,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 23 Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:58,719 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 83 transitions. cyclomatic complexity: 23. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 134 states and 171 transitions. Complement of second has 22 states. [2021-12-19 20:26:58,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:26:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2021-12-19 20:26:58,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 53 letters. Loop has 2 letters. [2021-12-19 20:26:58,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:58,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 55 letters. Loop has 2 letters. [2021-12-19 20:26:58,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:58,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 65 transitions. Stem has 53 letters. Loop has 4 letters. [2021-12-19 20:26:58,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:26:58,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 171 transitions. [2021-12-19 20:26:58,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:58,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 127 states and 161 transitions. [2021-12-19 20:26:58,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-19 20:26:58,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-19 20:26:58,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 161 transitions. [2021-12-19 20:26:58,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:58,723 INFO L681 BuchiCegarLoop]: Abstraction has 127 states and 161 transitions. [2021-12-19 20:26:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 161 transitions. [2021-12-19 20:26:58,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 67. [2021-12-19 20:26:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.164179104477612) internal successors, (78), 66 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2021-12-19 20:26:58,726 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-12-19 20:26:58,726 INFO L587 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-12-19 20:26:58,726 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-19 20:26:58,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 78 transitions. [2021-12-19 20:26:58,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:58,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:58,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:58,727 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:58,727 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:58,727 INFO L791 eck$LassoCheckResult]: Stem: 9931#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9932#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 9933#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 9926#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 9927#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 9928#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9929#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 9930#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9934#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 9960#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9959#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 9958#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9957#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 9956#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9955#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 9954#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9953#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 9952#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9951#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 9947#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9946#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 9939#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 9935#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9936#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9991#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9990#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9937#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9938#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9944#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9940#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9941#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9988#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9987#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9986#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9985#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9983#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9982#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9981#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9980#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9978#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9977#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9976#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9975#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9973#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9972#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9971#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9970#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9968#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9967#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9966#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9965#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9962#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9961#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 9950#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 9948#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9942#L517-3 [2021-12-19 20:26:58,728 INFO L793 eck$LassoCheckResult]: Loop: 9942#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9943#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9942#L517-3 [2021-12-19 20:26:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1473052982, now seen corresponding path program 17 times [2021-12-19 20:26:58,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:58,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895650097] [2021-12-19 20:26:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:58,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:26:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 91 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:58,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:26:58,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895650097] [2021-12-19 20:26:58,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895650097] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:26:58,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531189185] [2021-12-19 20:26:58,910 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 20:26:58,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:26:58,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:26:58,920 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:26:58,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2021-12-19 20:26:59,027 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-12-19 20:26:59,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:26:59,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-19 20:26:59,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:26:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 120 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:59,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:26:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 120 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:26:59,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531189185] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:26:59,432 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:26:59,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2021-12-19 20:26:59,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613206578] [2021-12-19 20:26:59,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:26:59,432 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:26:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 17 times [2021-12-19 20:26:59,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:59,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342738750] [2021-12-19 20:26:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:59,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:59,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:59,437 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:59,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:26:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-19 20:26:59,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2021-12-19 20:26:59,466 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. cyclomatic complexity: 22 Second operand has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:26:59,752 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2021-12-19 20:26:59,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-19 20:26:59,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 131 transitions. [2021-12-19 20:26:59,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:59,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 70 states and 81 transitions. [2021-12-19 20:26:59,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:26:59,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:26:59,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 81 transitions. [2021-12-19 20:26:59,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:26:59,754 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 81 transitions. [2021-12-19 20:26:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 81 transitions. [2021-12-19 20:26:59,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2021-12-19 20:26:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:26:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2021-12-19 20:26:59,756 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-12-19 20:26:59,756 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2021-12-19 20:26:59,756 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-19 20:26:59,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2021-12-19 20:26:59,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:26:59,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:26:59,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:26:59,757 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2021-12-19 20:26:59,757 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:26:59,758 INFO L791 eck$LassoCheckResult]: Stem: 10489#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 10491#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 10488#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 10484#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 10485#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10486#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 10487#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10492#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 10520#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10519#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 10518#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10517#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 10516#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10515#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 10514#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10513#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 10512#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10511#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 10510#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10509#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 10504#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10503#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 10497#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 10493#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10494#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10501#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 10498#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 10495#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10496#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10551#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 10550#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 10549#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10547#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10546#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 10545#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 10544#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10542#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10541#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 10540#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 10539#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10537#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10536#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 10535#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 10534#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10532#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10531#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 10530#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 10529#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10527#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10526#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 10525#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 10524#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10523#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10508#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 10507#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 10505#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10499#L517-3 [2021-12-19 20:26:59,758 INFO L793 eck$LassoCheckResult]: Loop: 10499#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10500#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10499#L517-3 [2021-12-19 20:26:59,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1562782376, now seen corresponding path program 18 times [2021-12-19 20:26:59,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:59,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136680068] [2021-12-19 20:26:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:59,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:59,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:59,800 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 18 times [2021-12-19 20:26:59,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:59,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012947009] [2021-12-19 20:26:59,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:59,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:59,804 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:59,807 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:26:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:26:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1404689107, now seen corresponding path program 9 times [2021-12-19 20:26:59,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:26:59,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230740722] [2021-12-19 20:26:59,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:26:59,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:26:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:59,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:26:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:26:59,844 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:03,457 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:27:03,457 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:27:03,457 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:27:03,457 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:27:03,457 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:27:03,457 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:03,457 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:27:03,457 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:27:03,457 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration21_Lasso [2021-12-19 20:27:03,457 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:27:03,457 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:27:03,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:03,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:03,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:04,985 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:27:04,985 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:27:04,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:04,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:04,986 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:04,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2021-12-19 20:27:04,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:04,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:04,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:27:04,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:04,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:04,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:04,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:27:04,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:27:04,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:05,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2021-12-19 20:27:05,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:05,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:05,011 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:05,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2021-12-19 20:27:05,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:05,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:05,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:05,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:05,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:05,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:05,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:05,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:05,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:05,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:05,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:05,037 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:05,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2021-12-19 20:27:05,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:05,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:05,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:05,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:05,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:05,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:05,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:05,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:05,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:05,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:05,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:05,065 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:05,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2021-12-19 20:27:05,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:05,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:05,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:05,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:05,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:05,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:05,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:05,079 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:27:05,085 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-19 20:27:05,085 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:27:05,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:05,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:05,086 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:05,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2021-12-19 20:27:05,088 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:27:05,094 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:27:05,094 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:27:05,094 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 32))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 32))_2 Supporting invariants [] [2021-12-19 20:27:05,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:05,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:05,515 INFO L297 tatePredicateManager]: 156 out of 158 supporting invariants were superfluous and have been removed [2021-12-19 20:27:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:05,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-19 20:27:05,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:05,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:05,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:05,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2021-12-19 20:27:05,953 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:05,979 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 82 transitions. Complement of second has 4 states. [2021-12-19 20:27:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:27:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:27:05,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 57 letters. Loop has 2 letters. [2021-12-19 20:27:05,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:05,981 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:27:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:06,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-19 20:27:06,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:06,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:06,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:06,410 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2021-12-19 20:27:06,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:06,435 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 82 transitions. Complement of second has 4 states. [2021-12-19 20:27:06,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:27:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:27:06,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 57 letters. Loop has 2 letters. [2021-12-19 20:27:06,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:06,436 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:27:06,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:06,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-19 20:27:06,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:06,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:06,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:06,881 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2021-12-19 20:27:06,881 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:07,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 113 transitions. Complement of second has 24 states. [2021-12-19 20:27:07,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:27:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2021-12-19 20:27:07,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 71 transitions. Stem has 57 letters. Loop has 2 letters. [2021-12-19 20:27:07,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:07,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 71 transitions. Stem has 59 letters. Loop has 2 letters. [2021-12-19 20:27:07,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:07,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 71 transitions. Stem has 57 letters. Loop has 4 letters. [2021-12-19 20:27:07,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:07,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 113 transitions. [2021-12-19 20:27:07,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:07,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 86 states and 106 transitions. [2021-12-19 20:27:07,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:27:07,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:27:07,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 106 transitions. [2021-12-19 20:27:07,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:27:07,100 INFO L681 BuchiCegarLoop]: Abstraction has 86 states and 106 transitions. [2021-12-19 20:27:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 106 transitions. [2021-12-19 20:27:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2021-12-19 20:27:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.162162162162162) internal successors, (86), 73 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2021-12-19 20:27:07,102 INFO L704 BuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2021-12-19 20:27:07,102 INFO L587 BuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2021-12-19 20:27:07,102 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-19 20:27:07,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2021-12-19 20:27:07,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:07,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:27:07,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:27:07,103 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2021-12-19 20:27:07,103 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:27:07,104 INFO L791 eck$LassoCheckResult]: Stem: 12052#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12053#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 12054#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 12047#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 12048#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12049#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12050#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12051#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12055#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12080#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12079#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12078#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12077#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12076#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12075#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12074#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12073#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12072#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12071#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12070#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12069#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12068#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12067#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 12062#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 12056#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12057#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12119#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12118#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12058#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12059#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12065#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12060#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12061#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12116#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12115#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12114#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12113#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12111#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12110#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12109#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12108#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12106#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12105#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12104#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12103#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12101#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12100#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12099#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12098#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12096#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12095#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12094#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12093#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12091#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12090#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12089#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12088#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12087#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12084#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12083#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12081#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12063#L517-3 [2021-12-19 20:27:07,104 INFO L793 eck$LassoCheckResult]: Loop: 12063#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12064#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12063#L517-3 [2021-12-19 20:27:07,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1286501379, now seen corresponding path program 19 times [2021-12-19 20:27:07,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:07,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716769357] [2021-12-19 20:27:07,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:07,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 120 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:07,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:27:07,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716769357] [2021-12-19 20:27:07,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716769357] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:27:07,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213715534] [2021-12-19 20:27:07,299 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-19 20:27:07,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:27:07,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:07,300 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:27:07,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Waiting until timeout for monitored process [2021-12-19 20:27:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:07,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-19 20:27:07,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 153 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:07,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:27:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 153 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:07,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213715534] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:27:07,825 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:27:07,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2021-12-19 20:27:07,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672067984] [2021-12-19 20:27:07,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:27:07,825 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:27:07,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 19 times [2021-12-19 20:27:07,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:07,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930439271] [2021-12-19 20:27:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:07,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:07,829 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:07,831 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:07,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:27:07,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-19 20:27:07,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2021-12-19 20:27:07,864 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. cyclomatic complexity: 24 Second operand has 35 states, 34 states have (on average 3.1470588235294117) internal successors, (107), 35 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:27:08,112 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2021-12-19 20:27:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-19 20:27:08,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 145 transitions. [2021-12-19 20:27:08,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:08,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 77 states and 89 transitions. [2021-12-19 20:27:08,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:27:08,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:27:08,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 89 transitions. [2021-12-19 20:27:08,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:27:08,115 INFO L681 BuchiCegarLoop]: Abstraction has 77 states and 89 transitions. [2021-12-19 20:27:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 89 transitions. [2021-12-19 20:27:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-12-19 20:27:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 75 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2021-12-19 20:27:08,117 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 88 transitions. [2021-12-19 20:27:08,117 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 88 transitions. [2021-12-19 20:27:08,117 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-12-19 20:27:08,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 88 transitions. [2021-12-19 20:27:08,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:08,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:27:08,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:27:08,121 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2021-12-19 20:27:08,121 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:27:08,121 INFO L791 eck$LassoCheckResult]: Stem: 12670#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12671#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 12672#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 12669#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 12665#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12666#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12667#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12668#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12673#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12703#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12702#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12701#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12700#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12699#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12698#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12697#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12696#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12695#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12694#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12693#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12692#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12691#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12690#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 12685#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12684#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 12678#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 12674#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12675#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12682#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12679#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12676#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12677#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12739#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12738#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12737#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12735#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12734#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12733#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12732#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12730#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12729#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12728#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12727#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12725#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12724#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12723#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12722#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12720#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12719#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12718#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12717#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12715#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12714#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12713#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12712#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12710#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12709#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12708#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12707#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12706#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12689#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 12688#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 12686#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12680#L517-3 [2021-12-19 20:27:08,121 INFO L793 eck$LassoCheckResult]: Loop: 12680#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12681#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12680#L517-3 [2021-12-19 20:27:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash 832559451, now seen corresponding path program 20 times [2021-12-19 20:27:08,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:08,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386425300] [2021-12-19 20:27:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:08,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:08,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:08,177 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:08,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:08,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 20 times [2021-12-19 20:27:08,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:08,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791365400] [2021-12-19 20:27:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:08,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:08,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:08,185 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:08,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:08,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1225716512, now seen corresponding path program 10 times [2021-12-19 20:27:08,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:08,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297610451] [2021-12-19 20:27:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:08,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:08,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:08,227 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:14,315 WARN L227 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 384 DAG size of output: 260 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:27:15,189 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:27:15,189 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:27:15,189 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:27:15,189 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:27:15,189 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:27:15,189 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:15,189 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:27:15,189 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:27:15,189 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration23_Lasso [2021-12-19 20:27:15,189 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:27:15,189 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:27:15,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:15,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:15,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:15,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:16,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:17,212 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:27:17,212 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:27:17,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:17,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:17,216 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:17,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2021-12-19 20:27:17,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:17,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:17,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:27:17,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:17,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:17,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:17,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:27:17,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:27:17,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:17,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:17,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:17,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:17,241 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:17,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2021-12-19 20:27:17,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:17,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:17,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:17,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:17,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:17,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:17,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:17,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:17,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:17,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:17,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:17,266 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:17,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2021-12-19 20:27:17,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:17,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:17,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:17,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:17,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:17,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:17,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:17,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:17,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:17,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:17,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:17,293 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:17,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2021-12-19 20:27:17,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:17,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:17,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:17,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:17,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:17,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:17,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:17,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:27:17,312 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-19 20:27:17,312 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:27:17,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:17,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:17,313 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:17,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2021-12-19 20:27:17,315 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:27:17,321 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:27:17,321 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:27:17,321 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 36))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 36))_1 Supporting invariants [] [2021-12-19 20:27:17,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2021-12-19 20:27:17,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:17,958 INFO L297 tatePredicateManager]: 193 out of 195 supporting invariants were superfluous and have been removed [2021-12-19 20:27:17,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:18,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-19 20:27:18,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:18,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:18,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:18,471 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2021-12-19 20:27:18,471 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24 Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:18,500 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 90 transitions. Complement of second has 4 states. [2021-12-19 20:27:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:27:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:27:18,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 63 letters. Loop has 2 letters. [2021-12-19 20:27:18,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:18,500 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:27:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:18,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-19 20:27:18,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:18,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:18,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:18,972 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 2 loop predicates [2021-12-19 20:27:18,972 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24 Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:19,000 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 90 transitions. Complement of second has 4 states. [2021-12-19 20:27:19,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:27:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:27:19,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 63 letters. Loop has 2 letters. [2021-12-19 20:27:19,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:19,002 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:27:19,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:19,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-19 20:27:19,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:19,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:19,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:19,506 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2021-12-19 20:27:19,506 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24 Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:19,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 99 states and 123 transitions. Complement of second has 26 states. [2021-12-19 20:27:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 11 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:27:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2021-12-19 20:27:19,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 77 transitions. Stem has 63 letters. Loop has 2 letters. [2021-12-19 20:27:19,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:19,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 77 transitions. Stem has 65 letters. Loop has 2 letters. [2021-12-19 20:27:19,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:19,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 77 transitions. Stem has 63 letters. Loop has 4 letters. [2021-12-19 20:27:19,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:19,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 123 transitions. [2021-12-19 20:27:19,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:19,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 94 states and 116 transitions. [2021-12-19 20:27:19,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:27:19,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:27:19,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 116 transitions. [2021-12-19 20:27:19,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:27:19,749 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 116 transitions. [2021-12-19 20:27:19,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 116 transitions. [2021-12-19 20:27:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2021-12-19 20:27:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 80 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2021-12-19 20:27:19,750 INFO L704 BuchiCegarLoop]: Abstraction has 81 states and 94 transitions. [2021-12-19 20:27:19,751 INFO L587 BuchiCegarLoop]: Abstraction has 81 states and 94 transitions. [2021-12-19 20:27:19,751 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-12-19 20:27:19,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 94 transitions. [2021-12-19 20:27:19,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:19,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:27:19,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:27:19,752 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2021-12-19 20:27:19,752 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:27:19,752 INFO L791 eck$LassoCheckResult]: Stem: 14470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14471#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 14472#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 14469#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 14465#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 14466#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14467#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 14468#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14473#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 14500#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14499#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 14498#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14497#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 14496#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14495#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 14494#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14493#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 14492#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14491#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 14490#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14489#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 14488#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14487#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 14486#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14485#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 14478#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 14474#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14475#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14544#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 14543#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 14476#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14477#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14484#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 14479#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 14480#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14541#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14540#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 14539#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 14538#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14536#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14535#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 14534#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 14533#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14531#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14530#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 14529#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 14528#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14526#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14525#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 14524#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 14523#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14521#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14520#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 14519#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 14518#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14516#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14515#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 14514#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 14513#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14511#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14510#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 14509#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 14508#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14507#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14504#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 14503#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 14501#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14482#L517-3 [2021-12-19 20:27:19,752 INFO L793 eck$LassoCheckResult]: Loop: 14482#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14481#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14482#L517-3 [2021-12-19 20:27:19,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:19,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1092528432, now seen corresponding path program 21 times [2021-12-19 20:27:19,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:19,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103821343] [2021-12-19 20:27:19,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:19,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 153 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:20,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:27:20,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103821343] [2021-12-19 20:27:20,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103821343] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:27:20,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462628843] [2021-12-19 20:27:20,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 20:27:20,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:27:20,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:20,027 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:27:20,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Waiting until timeout for monitored process [2021-12-19 20:27:20,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-19 20:27:20,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:27:20,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-19 20:27:20,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 190 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:20,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:27:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 190 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:20,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462628843] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:27:20,828 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:27:20,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 37 [2021-12-19 20:27:20,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713233038] [2021-12-19 20:27:20,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:27:20,829 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:27:20,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:20,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 21 times [2021-12-19 20:27:20,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:20,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326711859] [2021-12-19 20:27:20,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:20,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:20,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:20,836 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:20,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:27:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-19 20:27:20,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1089, Unknown=0, NotChecked=0, Total=1406 [2021-12-19 20:27:20,873 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. cyclomatic complexity: 26 Second operand has 38 states, 37 states have (on average 3.1621621621621623) internal successors, (117), 38 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:27:21,218 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2021-12-19 20:27:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-19 20:27:21,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 159 transitions. [2021-12-19 20:27:21,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:21,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 84 states and 97 transitions. [2021-12-19 20:27:21,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:27:21,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:27:21,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 97 transitions. [2021-12-19 20:27:21,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:27:21,220 INFO L681 BuchiCegarLoop]: Abstraction has 84 states and 97 transitions. [2021-12-19 20:27:21,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 97 transitions. [2021-12-19 20:27:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-12-19 20:27:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 82 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2021-12-19 20:27:21,221 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 96 transitions. [2021-12-19 20:27:21,221 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 96 transitions. [2021-12-19 20:27:21,222 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-12-19 20:27:21,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 96 transitions. [2021-12-19 20:27:21,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:21,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:27:21,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:27:21,223 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2021-12-19 20:27:21,223 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:27:21,223 INFO L791 eck$LassoCheckResult]: Stem: 15148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 15150#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 15143#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 15144#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 15145#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15146#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 15147#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15151#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 15183#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15182#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 15181#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15180#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 15179#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15178#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 15177#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15176#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 15175#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15174#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 15173#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15172#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 15171#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15170#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 15169#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15168#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 15163#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15162#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 15157#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 15152#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15153#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 15160#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15156#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 15154#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15155#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 15224#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15223#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 15222#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15220#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 15219#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15218#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 15217#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15215#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 15214#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15213#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 15212#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15210#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 15209#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15208#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 15207#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15205#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 15204#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15203#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 15202#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15200#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 15199#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15198#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 15197#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15195#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 15194#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15193#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 15192#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15190#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 15189#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15188#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 15187#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15186#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 15167#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 15166#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 15164#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 15158#L517-3 [2021-12-19 20:27:21,223 INFO L793 eck$LassoCheckResult]: Loop: 15158#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 15159#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 15158#L517-3 [2021-12-19 20:27:21,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash -112658418, now seen corresponding path program 22 times [2021-12-19 20:27:21,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:21,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213776943] [2021-12-19 20:27:21,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:21,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:21,247 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:21,267 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:21,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 22 times [2021-12-19 20:27:21,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:21,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228920476] [2021-12-19 20:27:21,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:21,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:21,271 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:21,274 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:21,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:21,274 INFO L85 PathProgramCache]: Analyzing trace with hash -890556141, now seen corresponding path program 11 times [2021-12-19 20:27:21,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:21,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682679562] [2021-12-19 20:27:21,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:21,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:21,305 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:21,325 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:28,337 WARN L227 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 417 DAG size of output: 281 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:27:29,006 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:27:29,007 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:27:29,007 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:27:29,007 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:27:29,007 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:27:29,007 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:29,007 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:27:29,007 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:27:29,007 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration25_Lasso [2021-12-19 20:27:29,007 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:27:29,007 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:27:29,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:29,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:29,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:29,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:29,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:30,978 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:27:30,979 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:27:30,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:30,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:30,984 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:30,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2021-12-19 20:27:30,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:30,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:30,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:27:30,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:30,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:30,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:30,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:27:30,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:27:30,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:31,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:31,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:31,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:31,012 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:31,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2021-12-19 20:27:31,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:31,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:31,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:27:31,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:31,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:31,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:31,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:27:31,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:27:31,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:31,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2021-12-19 20:27:31,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:31,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:31,035 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:31,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2021-12-19 20:27:31,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:31,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:31,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:27:31,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:31,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:31,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:31,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:27:31,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:27:31,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:31,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2021-12-19 20:27:31,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:31,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:31,060 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:31,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2021-12-19 20:27:31,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:31,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:31,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:31,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:31,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:31,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:31,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:31,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:31,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:31,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:31,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:31,087 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:31,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2021-12-19 20:27:31,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:31,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:31,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:31,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:31,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:31,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:31,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:31,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:31,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:31,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:31,124 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:31,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2021-12-19 20:27:31,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:31,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:31,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:31,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:31,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:31,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:31,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:31,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:31,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2021-12-19 20:27:31,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:31,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:31,153 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:31,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2021-12-19 20:27:31,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:31,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:31,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:31,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:31,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:31,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:31,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:31,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:31,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2021-12-19 20:27:31,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:31,182 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:31,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2021-12-19 20:27:31,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:31,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:31,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:31,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:31,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:31,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:31,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:31,195 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:27:31,201 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-19 20:27:31,201 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-19 20:27:31,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:31,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:31,202 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:31,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2021-12-19 20:27:31,203 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:27:31,210 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:27:31,210 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:27:31,210 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~k~0#1 4) (- 4)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset (* ULTIMATE.start_main_~k~0#1 4) (- 4)))_2 Supporting invariants [] [2021-12-19 20:27:31,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2021-12-19 20:27:31,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2021-12-19 20:27:32,080 INFO L297 tatePredicateManager]: 234 out of 236 supporting invariants were superfluous and have been removed [2021-12-19 20:27:32,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:32,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-19 20:27:32,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:32,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:32,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:32,994 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.24 stem predicates 2 loop predicates [2021-12-19 20:27:32,995 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26 Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:33,210 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 104 transitions. Complement of second has 16 states. [2021-12-19 20:27:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 14 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:27:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 36 transitions. [2021-12-19 20:27:33,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 36 transitions. Stem has 69 letters. Loop has 2 letters. [2021-12-19 20:27:33,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:33,211 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:27:33,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:33,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-19 20:27:33,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:34,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:34,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:34,090 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.24 stem predicates 2 loop predicates [2021-12-19 20:27:34,090 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26 Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:34,273 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 104 transitions. Complement of second has 16 states. [2021-12-19 20:27:34,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 14 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:27:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 36 transitions. [2021-12-19 20:27:34,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 36 transitions. Stem has 69 letters. Loop has 2 letters. [2021-12-19 20:27:34,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:34,273 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:27:34,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:34,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-19 20:27:34,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:35,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:35,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:35,179 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.24 stem predicates 2 loop predicates [2021-12-19 20:27:35,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26 Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:35,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 179 states and 228 transitions. Complement of second has 41 states. [2021-12-19 20:27:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 28 states 24 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:27:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 115 transitions. [2021-12-19 20:27:35,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 115 transitions. Stem has 69 letters. Loop has 2 letters. [2021-12-19 20:27:35,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:35,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 115 transitions. Stem has 71 letters. Loop has 2 letters. [2021-12-19 20:27:35,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:35,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 115 transitions. Stem has 69 letters. Loop has 4 letters. [2021-12-19 20:27:35,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:35,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 228 transitions. [2021-12-19 20:27:35,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-19 20:27:35,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 174 states and 221 transitions. [2021-12-19 20:27:35,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-19 20:27:35,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-19 20:27:35,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 221 transitions. [2021-12-19 20:27:35,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:27:35,764 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 221 transitions. [2021-12-19 20:27:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 221 transitions. [2021-12-19 20:27:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 92. [2021-12-19 20:27:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 91 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2021-12-19 20:27:35,766 INFO L704 BuchiCegarLoop]: Abstraction has 92 states and 107 transitions. [2021-12-19 20:27:35,766 INFO L587 BuchiCegarLoop]: Abstraction has 92 states and 107 transitions. [2021-12-19 20:27:35,766 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-12-19 20:27:35,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 107 transitions. [2021-12-19 20:27:35,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:35,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:27:35,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:27:35,767 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2021-12-19 20:27:35,767 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:27:35,768 INFO L791 eck$LassoCheckResult]: Stem: 17392#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 17393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 17394#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 17391#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 17387#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17388#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17389#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17390#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17395#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17424#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17423#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17422#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17421#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17420#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17419#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17418#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17417#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17416#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17415#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17414#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17413#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17412#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17411#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17410#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17408#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17409#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17478#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 17407#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 17406#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 17399#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 17396#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 17397#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 17404#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 17400#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 17401#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 17470#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 17469#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 17468#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 17467#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 17465#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 17464#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 17463#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 17462#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 17460#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 17459#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 17458#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 17457#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 17455#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 17454#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 17453#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 17452#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 17450#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 17449#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 17448#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 17447#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 17445#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 17444#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 17443#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 17442#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 17440#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 17439#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 17438#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 17437#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 17435#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 17434#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 17433#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 17432#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 17431#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 17428#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 17427#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 17425#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 17402#L517-3 [2021-12-19 20:27:35,768 INFO L793 eck$LassoCheckResult]: Loop: 17402#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 17403#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 17402#L517-3 [2021-12-19 20:27:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:35,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1343948652, now seen corresponding path program 23 times [2021-12-19 20:27:35,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:35,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857759298] [2021-12-19 20:27:35,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:35,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:35,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:35,828 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:35,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:35,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 23 times [2021-12-19 20:27:35,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:35,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037179613] [2021-12-19 20:27:35,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:35,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:35,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:35,836 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:35,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1250500367, now seen corresponding path program 12 times [2021-12-19 20:27:35,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:35,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102037326] [2021-12-19 20:27:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:35,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:35,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:35,884 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:46,753 WARN L227 SmtUtils]: Spent 10.83s on a formula simplification. DAG size of input: 434 DAG size of output: 292 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:27:47,751 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:27:47,751 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:27:47,751 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:27:47,751 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:27:47,751 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:27:47,751 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:47,752 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:27:47,752 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:27:47,752 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration26_Lasso [2021-12-19 20:27:47,752 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:27:47,752 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:27:47,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:47,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:47,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:47,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:27:50,937 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:27:50,937 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:27:50,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:50,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:50,939 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:50,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2021-12-19 20:27:50,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:50,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:50,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:50,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:50,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:50,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:50,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:50,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:50,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2021-12-19 20:27:50,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:50,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:50,968 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:50,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2021-12-19 20:27:50,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:50,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:50,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:50,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:50,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:50,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:50,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:51,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:51,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:51,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:51,024 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:51,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:51,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:51,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:27:51,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:51,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:51,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:51,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:27:51,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:27:51,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2021-12-19 20:27:51,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:51,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:51,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:51,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:51,072 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:51,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:51,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:51,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:51,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:51,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:51,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:51,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:51,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2021-12-19 20:27:51,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:51,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:51,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:51,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:51,121 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:51,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:51,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:51,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:51,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:51,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:51,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:51,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:51,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2021-12-19 20:27:51,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:51,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:51,169 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:51,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:51,170 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:51,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2021-12-19 20:27:51,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:51,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:51,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:51,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:51,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:51,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:51,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:51,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:51,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:51,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:51,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:51,227 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:51,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:51,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2021-12-19 20:27:51,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:51,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:51,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:51,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:51,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:51,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:51,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:51,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:51,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:51,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:51,279 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:51,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:51,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:51,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:51,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:51,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:51,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:51,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:51,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2021-12-19 20:27:51,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:27:51,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:51,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:51,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:51,338 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:51,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:27:51,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:27:51,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:27:51,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:27:51,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:27:51,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2021-12-19 20:27:51,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:27:51,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:27:51,368 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:27:51,373 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-19 20:27:51,373 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:27:51,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:27:51,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:51,374 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:27:51,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2021-12-19 20:27:51,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:27:51,382 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:27:51,382 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:27:51,382 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 40))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 40))_1 Supporting invariants [] [2021-12-19 20:27:51,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2021-12-19 20:27:51,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0 [2021-12-19 20:27:52,306 INFO L297 tatePredicateManager]: 256 out of 258 supporting invariants were superfluous and have been removed [2021-12-19 20:27:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:52,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-19 20:27:52,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:52,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:52,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:52,840 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2021-12-19 20:27:52,840 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 107 transitions. cyclomatic complexity: 29 Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:52,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 107 transitions. cyclomatic complexity: 29. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 94 states and 111 transitions. Complement of second has 4 states. [2021-12-19 20:27:52,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:27:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:27:52,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 71 letters. Loop has 2 letters. [2021-12-19 20:27:52,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:52,871 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:27:52,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:52,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-19 20:27:52,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:53,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:53,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:53,455 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2021-12-19 20:27:53,455 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 107 transitions. cyclomatic complexity: 29 Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:53,483 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 107 transitions. cyclomatic complexity: 29. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 94 states and 111 transitions. Complement of second has 4 states. [2021-12-19 20:27:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:27:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:27:53,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 71 letters. Loop has 2 letters. [2021-12-19 20:27:53,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:53,485 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:27:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:53,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-19 20:27:53,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:53,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:27:54,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:54,024 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2021-12-19 20:27:54,024 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 107 transitions. cyclomatic complexity: 29 Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:54,292 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 107 transitions. cyclomatic complexity: 29. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 176 states and 225 transitions. Complement of second has 28 states. [2021-12-19 20:27:54,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:27:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2021-12-19 20:27:54,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 83 transitions. Stem has 71 letters. Loop has 2 letters. [2021-12-19 20:27:54,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:54,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 83 transitions. Stem has 73 letters. Loop has 2 letters. [2021-12-19 20:27:54,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:54,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 83 transitions. Stem has 71 letters. Loop has 4 letters. [2021-12-19 20:27:54,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:27:54,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 225 transitions. [2021-12-19 20:27:54,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:54,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 169 states and 215 transitions. [2021-12-19 20:27:54,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-19 20:27:54,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-19 20:27:54,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 215 transitions. [2021-12-19 20:27:54,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:27:54,302 INFO L681 BuchiCegarLoop]: Abstraction has 169 states and 215 transitions. [2021-12-19 20:27:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 215 transitions. [2021-12-19 20:27:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 88. [2021-12-19 20:27:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2021-12-19 20:27:54,304 INFO L704 BuchiCegarLoop]: Abstraction has 88 states and 102 transitions. [2021-12-19 20:27:54,304 INFO L587 BuchiCegarLoop]: Abstraction has 88 states and 102 transitions. [2021-12-19 20:27:54,305 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-12-19 20:27:54,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 102 transitions. [2021-12-19 20:27:54,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:54,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:27:54,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:27:54,306 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2021-12-19 20:27:54,306 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:27:54,306 INFO L791 eck$LassoCheckResult]: Stem: 19649#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 19650#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 19651#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 19644#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 19645#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 19646#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19647#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 19648#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19685#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 19684#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19683#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 19682#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19681#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 19680#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19679#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 19678#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19677#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 19676#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19675#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 19674#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19673#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 19672#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19671#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 19670#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19669#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 19664#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 19663#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 19658#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 19652#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19653#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19730#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 19729#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 19654#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19655#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19661#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 19656#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 19657#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19727#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19726#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 19725#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 19724#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19722#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19721#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 19720#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 19719#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19717#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19716#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 19715#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 19714#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19712#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19711#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 19710#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 19709#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19707#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19706#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 19705#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 19704#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19702#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19701#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 19700#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 19699#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19697#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19696#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 19695#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 19694#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19692#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19691#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 19690#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 19689#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19686#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19668#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 19667#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 19665#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 19659#L517-3 [2021-12-19 20:27:54,307 INFO L793 eck$LassoCheckResult]: Loop: 19659#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 19660#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 19659#L517-3 [2021-12-19 20:27:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1125960093, now seen corresponding path program 24 times [2021-12-19 20:27:54,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:54,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13348945] [2021-12-19 20:27:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:54,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:27:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 190 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:54,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:27:54,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13348945] [2021-12-19 20:27:54,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13348945] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:27:54,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405859031] [2021-12-19 20:27:54,614 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-19 20:27:54,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:27:54,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:27:54,615 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:27:54,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (207)] Waiting until timeout for monitored process [2021-12-19 20:27:55,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2021-12-19 20:27:55,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:27:55,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-19 20:27:55,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:27:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 231 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:55,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:27:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 231 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:27:55,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405859031] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:27:55,805 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:27:55,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 40 [2021-12-19 20:27:55,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475836886] [2021-12-19 20:27:55,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:27:55,808 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:27:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 24 times [2021-12-19 20:27:55,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:55,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171607485] [2021-12-19 20:27:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:55,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:55,812 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:55,814 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:55,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:27:55,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-19 20:27:55,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2021-12-19 20:27:55,854 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. cyclomatic complexity: 28 Second operand has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:27:56,199 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2021-12-19 20:27:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-19 20:27:56,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 173 transitions. [2021-12-19 20:27:56,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:56,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 91 states and 105 transitions. [2021-12-19 20:27:56,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:27:56,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:27:56,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 105 transitions. [2021-12-19 20:27:56,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:27:56,201 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 105 transitions. [2021-12-19 20:27:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 105 transitions. [2021-12-19 20:27:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2021-12-19 20:27:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 89 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:27:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2021-12-19 20:27:56,203 INFO L704 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2021-12-19 20:27:56,203 INFO L587 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2021-12-19 20:27:56,203 INFO L425 BuchiCegarLoop]: ======== Iteration 28============ [2021-12-19 20:27:56,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2021-12-19 20:27:56,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:27:56,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:27:56,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:27:56,204 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2021-12-19 20:27:56,204 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:27:56,205 INFO L791 eck$LassoCheckResult]: Stem: 20387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 20388#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 20389#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 20386#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 20382#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20383#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20384#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20385#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20390#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20424#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20423#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20422#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20421#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20420#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20419#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20418#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20417#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20416#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20415#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20414#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20413#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20412#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20411#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20410#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20409#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20408#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20407#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 20402#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 20401#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 20396#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 20391#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20392#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20399#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 20395#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 20393#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20394#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20470#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 20469#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 20468#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20466#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20465#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 20464#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 20463#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20461#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20460#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 20459#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 20458#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20456#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20455#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 20454#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 20453#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20451#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20450#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 20449#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 20448#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20446#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20445#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 20444#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 20443#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20441#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20440#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 20439#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 20438#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20436#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20435#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 20434#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 20433#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20431#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20430#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 20429#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 20428#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20427#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20406#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 20405#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 20403#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 20397#L517-3 [2021-12-19 20:27:56,205 INFO L793 eck$LassoCheckResult]: Loop: 20397#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 20398#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 20397#L517-3 [2021-12-19 20:27:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash 859989697, now seen corresponding path program 25 times [2021-12-19 20:27:56,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:56,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305207108] [2021-12-19 20:27:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:56,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:56,227 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:56,249 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:56,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:56,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 25 times [2021-12-19 20:27:56,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:56,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931631217] [2021-12-19 20:27:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:56,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:56,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:56,257 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:27:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:27:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1816379142, now seen corresponding path program 13 times [2021-12-19 20:27:56,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:27:56,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403835130] [2021-12-19 20:27:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:27:56,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:27:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:56,279 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:27:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:27:56,301 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:06,976 WARN L227 SmtUtils]: Spent 10.64s on a formula simplification. DAG size of input: 450 DAG size of output: 302 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:28:07,829 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:28:07,829 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:28:07,829 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:28:07,829 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:28:07,829 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:28:07,829 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:07,829 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:28:07,829 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:28:07,829 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration28_Lasso [2021-12-19 20:28:07,829 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:28:07,829 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:28:07,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:07,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:07,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:07,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:07,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:07,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:07,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:07,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:07,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:07,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:07,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:12,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:12,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:12,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:12,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:12,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:12,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:12,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:12,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:12,760 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:28:12,760 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:28:12,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:12,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:12,770 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:12,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2021-12-19 20:28:12,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:12,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:12,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:12,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:12,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:12,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:12,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:12,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:12,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:12,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:12,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:12,822 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:12,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:12,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:12,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:12,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:12,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:12,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:12,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:12,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2021-12-19 20:28:12,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:12,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:12,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:12,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:12,865 INFO L229 MonitoredProcess]: Starting monitored process 210 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:12,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2021-12-19 20:28:12,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:12,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:12,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:12,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:12,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:12,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:12,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:12,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:12,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2021-12-19 20:28:12,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:12,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:12,892 INFO L229 MonitoredProcess]: Starting monitored process 211 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:12,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2021-12-19 20:28:12,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:12,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:12,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:12,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:12,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:12,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:12,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:12,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:12,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:12,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2021-12-19 20:28:12,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:12,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:12,920 INFO L229 MonitoredProcess]: Starting monitored process 212 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:12,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2021-12-19 20:28:12,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:12,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:12,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:12,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:12,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:12,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:12,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:12,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:12,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:12,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2021-12-19 20:28:12,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:12,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:12,944 INFO L229 MonitoredProcess]: Starting monitored process 213 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:12,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2021-12-19 20:28:12,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:12,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:12,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:12,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:12,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:12,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:12,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:12,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:12,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:12,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2021-12-19 20:28:12,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:12,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:12,967 INFO L229 MonitoredProcess]: Starting monitored process 214 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:12,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2021-12-19 20:28:12,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:12,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:12,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:12,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:12,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:12,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:12,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:12,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:12,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:12,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:12,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:12,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:12,992 INFO L229 MonitoredProcess]: Starting monitored process 215 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:12,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2021-12-19 20:28:12,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:12,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:12,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:12,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:12,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:12,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:13,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:13,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:13,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,016 INFO L229 MonitoredProcess]: Starting monitored process 216 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2021-12-19 20:28:13,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:13,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:13,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:13,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Ended with exit code 0 [2021-12-19 20:28:13,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,040 INFO L229 MonitoredProcess]: Starting monitored process 217 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2021-12-19 20:28:13,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:13,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:13,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:13,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Ended with exit code 0 [2021-12-19 20:28:13,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,064 INFO L229 MonitoredProcess]: Starting monitored process 218 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2021-12-19 20:28:13,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:13,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,092 INFO L229 MonitoredProcess]: Starting monitored process 219 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2021-12-19 20:28:13,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Ended with exit code 0 [2021-12-19 20:28:13,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,127 INFO L229 MonitoredProcess]: Starting monitored process 220 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2021-12-19 20:28:13,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:13,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,156 INFO L229 MonitoredProcess]: Starting monitored process 221 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2021-12-19 20:28:13,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Ended with exit code 0 [2021-12-19 20:28:13,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,184 INFO L229 MonitoredProcess]: Starting monitored process 222 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2021-12-19 20:28:13,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:13,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,213 INFO L229 MonitoredProcess]: Starting monitored process 223 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2021-12-19 20:28:13,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Ended with exit code 0 [2021-12-19 20:28:13,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,242 INFO L229 MonitoredProcess]: Starting monitored process 224 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2021-12-19 20:28:13,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Ended with exit code 0 [2021-12-19 20:28:13,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,269 INFO L229 MonitoredProcess]: Starting monitored process 225 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2021-12-19 20:28:13,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Ended with exit code 0 [2021-12-19 20:28:13,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,298 INFO L229 MonitoredProcess]: Starting monitored process 226 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2021-12-19 20:28:13,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Ended with exit code 0 [2021-12-19 20:28:13,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,326 INFO L229 MonitoredProcess]: Starting monitored process 227 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2021-12-19 20:28:13,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Ended with exit code 0 [2021-12-19 20:28:13,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,354 INFO L229 MonitoredProcess]: Starting monitored process 228 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2021-12-19 20:28:13,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:13,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Ended with exit code 0 [2021-12-19 20:28:13,382 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,383 INFO L229 MonitoredProcess]: Starting monitored process 229 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2021-12-19 20:28:13,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:13,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:13,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:13,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:13,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:13,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:13,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:13,398 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:28:13,404 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-19 20:28:13,404 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:28:13,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,406 INFO L229 MonitoredProcess]: Starting monitored process 230 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:13,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2021-12-19 20:28:13,407 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:28:13,413 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:28:13,413 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:28:13,414 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* ULTIMATE.start_main_~k~0#1 4) ULTIMATE.start_main_~numbers~0#1.offset (- 4)))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* ULTIMATE.start_main_~k~0#1 4) ULTIMATE.start_main_~numbers~0#1.offset (- 4)))_2 Supporting invariants [] [2021-12-19 20:28:13,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Ended with exit code 0 [2021-12-19 20:28:13,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:14,491 INFO L297 tatePredicateManager]: 279 out of 281 supporting invariants were superfluous and have been removed [2021-12-19 20:28:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:14,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-19 20:28:14,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:15,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:28:15,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:15,472 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.26 stem predicates 2 loop predicates [2021-12-19 20:28:15,472 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28 Second operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:15,710 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28. Second operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 96 states and 112 transitions. Complement of second has 17 states. [2021-12-19 20:28:15,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 15 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:28:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2021-12-19 20:28:15,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 38 transitions. Stem has 75 letters. Loop has 2 letters. [2021-12-19 20:28:15,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:15,711 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:28:15,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:15,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-19 20:28:15,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:16,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:28:16,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:16,694 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.26 stem predicates 2 loop predicates [2021-12-19 20:28:16,694 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28 Second operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:16,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28. Second operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 96 states and 112 transitions. Complement of second has 17 states. [2021-12-19 20:28:16,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 15 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:28:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2021-12-19 20:28:16,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 38 transitions. Stem has 75 letters. Loop has 2 letters. [2021-12-19 20:28:16,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:16,943 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:28:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:17,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-19 20:28:17,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:17,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:28:17,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:17,946 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.26 stem predicates 2 loop predicates [2021-12-19 20:28:17,947 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28 Second operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:18,826 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28. Second operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 193 states and 246 transitions. Complement of second has 44 states. [2021-12-19 20:28:18,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 30 states 26 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:28:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.75) internal successors, (77), 28 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 123 transitions. [2021-12-19 20:28:18,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 123 transitions. Stem has 75 letters. Loop has 2 letters. [2021-12-19 20:28:18,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:18,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 123 transitions. Stem has 77 letters. Loop has 2 letters. [2021-12-19 20:28:18,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:18,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 123 transitions. Stem has 75 letters. Loop has 4 letters. [2021-12-19 20:28:18,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:18,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 246 transitions. [2021-12-19 20:28:18,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-19 20:28:18,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 188 states and 239 transitions. [2021-12-19 20:28:18,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-19 20:28:18,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-19 20:28:18,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 239 transitions. [2021-12-19 20:28:18,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:18,830 INFO L681 BuchiCegarLoop]: Abstraction has 188 states and 239 transitions. [2021-12-19 20:28:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 239 transitions. [2021-12-19 20:28:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 99. [2021-12-19 20:28:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.1616161616161615) internal successors, (115), 98 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2021-12-19 20:28:18,832 INFO L704 BuchiCegarLoop]: Abstraction has 99 states and 115 transitions. [2021-12-19 20:28:18,832 INFO L587 BuchiCegarLoop]: Abstraction has 99 states and 115 transitions. [2021-12-19 20:28:18,832 INFO L425 BuchiCegarLoop]: ======== Iteration 29============ [2021-12-19 20:28:18,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 115 transitions. [2021-12-19 20:28:18,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:28:18,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:18,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:18,833 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:18,833 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:28:18,833 INFO L791 eck$LassoCheckResult]: Stem: 22915#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 22916#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 22917#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 22910#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 22911#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22912#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22913#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22914#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22918#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22949#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22948#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22947#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22946#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22945#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22944#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22943#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22942#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22941#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22940#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22939#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22938#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22937#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22936#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22935#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22934#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22933#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22931#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22932#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 23008#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 22930#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 22929#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 22924#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 22919#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 22920#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22928#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 22922#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 22923#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 23000#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22999#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 22998#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 22997#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 22995#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22994#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 22993#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 22992#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 22990#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22989#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 22988#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 22987#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 22985#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22984#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 22983#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 22982#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 22980#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22979#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 22978#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 22977#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 22975#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22974#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 22973#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 22972#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 22970#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22969#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 22968#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 22967#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 22965#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22964#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 22963#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 22962#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 22960#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22959#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 22958#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 22957#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 22956#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22953#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 22952#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 22950#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 22926#L517-3 [2021-12-19 20:28:18,834 INFO L793 eck$LassoCheckResult]: Loop: 22926#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 22925#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 22926#L517-3 [2021-12-19 20:28:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1902708833, now seen corresponding path program 26 times [2021-12-19 20:28:18,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:18,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482786945] [2021-12-19 20:28:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:18,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:18,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:18,880 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:18,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 26 times [2021-12-19 20:28:18,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:18,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990288684] [2021-12-19 20:28:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:18,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:18,884 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:18,887 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:18,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1152880740, now seen corresponding path program 14 times [2021-12-19 20:28:18,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:18,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24587573] [2021-12-19 20:28:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:18,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:18,911 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:18,944 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:31,382 WARN L227 SmtUtils]: Spent 12.40s on a formula simplification. DAG size of input: 467 DAG size of output: 313 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:28:32,669 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:28:32,669 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:28:32,669 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:28:32,669 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:28:32,670 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:28:32,670 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:32,670 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:28:32,670 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:28:32,670 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration29_Lasso [2021-12-19 20:28:32,670 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:28:32,670 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:28:32,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:32,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:34,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:35,108 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:28:35,108 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:28:35,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:35,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:35,113 INFO L229 MonitoredProcess]: Starting monitored process 231 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:35,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Waiting until timeout for monitored process [2021-12-19 20:28:35,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:35,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:35,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:35,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:35,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:35,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:35,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:35,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:35,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Ended with exit code 0 [2021-12-19 20:28:35,169 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:35,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:35,171 INFO L229 MonitoredProcess]: Starting monitored process 232 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:35,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:35,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:35,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:35,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:35,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:35,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:35,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:35,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2021-12-19 20:28:35,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:35,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:35,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:35,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:35,235 INFO L229 MonitoredProcess]: Starting monitored process 233 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:35,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:35,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:35,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:35,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:35,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:35,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:35,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:35,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2021-12-19 20:28:35,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:35,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:35,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:35,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:35,285 INFO L229 MonitoredProcess]: Starting monitored process 234 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:35,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:35,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:35,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2021-12-19 20:28:35,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:35,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:35,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:35,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:35,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:35,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:35,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:35,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:35,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:35,352 INFO L229 MonitoredProcess]: Starting monitored process 235 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:35,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:35,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:35,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:35,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:35,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:35,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:35,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:35,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2021-12-19 20:28:35,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:35,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:35,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:35,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:35,409 INFO L229 MonitoredProcess]: Starting monitored process 236 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:35,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:35,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:35,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:35,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:35,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:35,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:35,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:35,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2021-12-19 20:28:35,435 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:28:35,454 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-12-19 20:28:35,454 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:28:35,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:35,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:35,460 INFO L229 MonitoredProcess]: Starting monitored process 237 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:35,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Waiting until timeout for monitored process [2021-12-19 20:28:35,462 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:28:35,496 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:28:35,496 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:28:35,496 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 44))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 44))_1 Supporting invariants [] [2021-12-19 20:28:35,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:35,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:36,679 INFO L297 tatePredicateManager]: 303 out of 305 supporting invariants were superfluous and have been removed [2021-12-19 20:28:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:36,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-19 20:28:36,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:37,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:28:37,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:37,319 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2021-12-19 20:28:37,320 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 115 transitions. cyclomatic complexity: 31 Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:37,351 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 115 transitions. cyclomatic complexity: 31. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 101 states and 119 transitions. Complement of second has 4 states. [2021-12-19 20:28:37,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:28:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:28:37,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 77 letters. Loop has 2 letters. [2021-12-19 20:28:37,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:37,352 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:28:37,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:37,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-19 20:28:37,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:37,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:28:37,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:37,956 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2021-12-19 20:28:37,956 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 115 transitions. cyclomatic complexity: 31 Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:37,986 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 115 transitions. cyclomatic complexity: 31. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 101 states and 119 transitions. Complement of second has 4 states. [2021-12-19 20:28:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:28:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:28:37,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 77 letters. Loop has 2 letters. [2021-12-19 20:28:37,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:37,987 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:28:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:38,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-19 20:28:38,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:38,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:28:38,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:38,554 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2021-12-19 20:28:38,555 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 115 transitions. cyclomatic complexity: 31 Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:38,879 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 115 transitions. cyclomatic complexity: 31. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 190 states and 243 transitions. Complement of second has 30 states. [2021-12-19 20:28:38,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:28:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 89 transitions. [2021-12-19 20:28:38,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 89 transitions. Stem has 77 letters. Loop has 2 letters. [2021-12-19 20:28:38,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:38,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 89 transitions. Stem has 79 letters. Loop has 2 letters. [2021-12-19 20:28:38,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:38,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 89 transitions. Stem has 77 letters. Loop has 4 letters. [2021-12-19 20:28:38,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:38,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 243 transitions. [2021-12-19 20:28:38,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:28:38,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 183 states and 233 transitions. [2021-12-19 20:28:38,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-19 20:28:38,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-19 20:28:38,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 233 transitions. [2021-12-19 20:28:38,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:38,883 INFO L681 BuchiCegarLoop]: Abstraction has 183 states and 233 transitions. [2021-12-19 20:28:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 233 transitions. [2021-12-19 20:28:38,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 95. [2021-12-19 20:28:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 94 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2021-12-19 20:28:38,885 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2021-12-19 20:28:38,885 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2021-12-19 20:28:38,885 INFO L425 BuchiCegarLoop]: ======== Iteration 30============ [2021-12-19 20:28:38,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 110 transitions. [2021-12-19 20:28:38,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:28:38,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:38,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:38,886 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:38,886 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:28:38,886 INFO L791 eck$LassoCheckResult]: Stem: 25455#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 25456#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 25457#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 25450#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 25451#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25452#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25453#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25454#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25493#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25492#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25491#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25490#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25489#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25488#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25487#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25486#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25485#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25484#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25483#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25482#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25481#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25480#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25479#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25478#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25477#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25476#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25475#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 25470#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 25469#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 25464#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 25458#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25459#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25543#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25542#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25460#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25461#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25467#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25462#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25463#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25540#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25539#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25538#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25537#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25535#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25534#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25533#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25532#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25530#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25529#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25528#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25527#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25525#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25524#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25523#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25522#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25520#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25519#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25518#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25517#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25515#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25514#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25513#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25512#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25510#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25509#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25508#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25507#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25505#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25504#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25503#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25502#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25500#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25499#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25498#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25497#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25494#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25474#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 25473#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 25471#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 25465#L517-3 [2021-12-19 20:28:38,887 INFO L793 eck$LassoCheckResult]: Loop: 25465#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 25466#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 25465#L517-3 [2021-12-19 20:28:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:38,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1783632790, now seen corresponding path program 27 times [2021-12-19 20:28:38,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:38,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839932886] [2021-12-19 20:28:38,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:38,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 231 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:39,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:39,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839932886] [2021-12-19 20:28:39,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839932886] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:28:39,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973448254] [2021-12-19 20:28:39,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 20:28:39,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:28:39,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:39,173 INFO L229 MonitoredProcess]: Starting monitored process 238 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:28:39,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (238)] Waiting until timeout for monitored process [2021-12-19 20:28:39,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2021-12-19 20:28:39,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:28:39,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-19 20:28:39,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 276 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:40,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:28:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 276 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:40,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973448254] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:28:40,367 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:28:40,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 43 [2021-12-19 20:28:40,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737569877] [2021-12-19 20:28:40,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:28:40,368 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:28:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 27 times [2021-12-19 20:28:40,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:40,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118146193] [2021-12-19 20:28:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:40,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:40,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:40,381 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:40,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-19 20:28:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=1467, Unknown=0, NotChecked=0, Total=1892 [2021-12-19 20:28:40,418 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. cyclomatic complexity: 30 Second operand has 44 states, 43 states have (on average 3.186046511627907) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:40,809 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2021-12-19 20:28:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-19 20:28:40,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 187 transitions. [2021-12-19 20:28:40,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:28:40,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 98 states and 113 transitions. [2021-12-19 20:28:40,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:28:40,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:28:40,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 113 transitions. [2021-12-19 20:28:40,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:40,810 INFO L681 BuchiCegarLoop]: Abstraction has 98 states and 113 transitions. [2021-12-19 20:28:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 113 transitions. [2021-12-19 20:28:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2021-12-19 20:28:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 96 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2021-12-19 20:28:40,812 INFO L704 BuchiCegarLoop]: Abstraction has 97 states and 112 transitions. [2021-12-19 20:28:40,812 INFO L587 BuchiCegarLoop]: Abstraction has 97 states and 112 transitions. [2021-12-19 20:28:40,812 INFO L425 BuchiCegarLoop]: ======== Iteration 31============ [2021-12-19 20:28:40,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 112 transitions. [2021-12-19 20:28:40,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:28:40,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:40,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:40,819 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:40,819 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:28:40,819 INFO L791 eck$LassoCheckResult]: Stem: 26253#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 26254#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 26255#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 26248#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 26249#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26250#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26251#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26252#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26256#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26292#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26291#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26290#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26289#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26288#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26287#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26286#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26285#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26284#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26283#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26282#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26281#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26280#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26279#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26278#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26277#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26276#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26275#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26274#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26273#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 26268#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 26267#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 26262#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 26257#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26258#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26265#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26261#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26259#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26260#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26343#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26342#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26341#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26339#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26338#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26337#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26336#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26334#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26333#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26332#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26331#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26329#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26328#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26327#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26326#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26324#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26323#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26322#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26321#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26319#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26318#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26317#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26316#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26314#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26313#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26312#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26311#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26309#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26308#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26307#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26306#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26304#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26303#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26302#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26301#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26299#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26298#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26297#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26296#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26295#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26272#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 26271#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 26269#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 26263#L517-3 [2021-12-19 20:28:40,820 INFO L793 eck$LassoCheckResult]: Loop: 26263#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 26264#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 26263#L517-3 [2021-12-19 20:28:40,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash -183171724, now seen corresponding path program 28 times [2021-12-19 20:28:40,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:40,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256735409] [2021-12-19 20:28:40,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:40,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:40,843 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:40,868 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 28 times [2021-12-19 20:28:40,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:40,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273421544] [2021-12-19 20:28:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:40,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:40,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:40,875 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:40,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 65633529, now seen corresponding path program 15 times [2021-12-19 20:28:40,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:40,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691539384] [2021-12-19 20:28:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:40,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:40,899 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:40,924 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:56,592 WARN L227 SmtUtils]: Spent 15.63s on a formula simplification. DAG size of input: 483 DAG size of output: 323 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:28:58,470 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:28:58,470 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:28:58,470 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:28:58,470 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:28:58,470 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:28:58,470 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:58,470 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:28:58,470 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:28:58,470 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration31_Lasso [2021-12-19 20:28:58,471 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:28:58,471 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:28:58,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:58,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:03,634 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:29:03,635 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:29:03,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,640 INFO L229 MonitoredProcess]: Starting monitored process 239 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Waiting until timeout for monitored process [2021-12-19 20:29:03,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:03,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:03,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:03,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,669 INFO L229 MonitoredProcess]: Starting monitored process 240 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Waiting until timeout for monitored process [2021-12-19 20:29:03,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:03,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:03,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:03,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Ended with exit code 0 [2021-12-19 20:29:03,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,702 INFO L229 MonitoredProcess]: Starting monitored process 241 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Waiting until timeout for monitored process [2021-12-19 20:29:03,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:03,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:03,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Ended with exit code 0 [2021-12-19 20:29:03,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,727 INFO L229 MonitoredProcess]: Starting monitored process 242 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Waiting until timeout for monitored process [2021-12-19 20:29:03,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:03,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:03,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:03,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Ended with exit code 0 [2021-12-19 20:29:03,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,754 INFO L229 MonitoredProcess]: Starting monitored process 243 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Waiting until timeout for monitored process [2021-12-19 20:29:03,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:03,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:03,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Ended with exit code 0 [2021-12-19 20:29:03,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,781 INFO L229 MonitoredProcess]: Starting monitored process 244 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Waiting until timeout for monitored process [2021-12-19 20:29:03,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:03,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:03,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Ended with exit code 0 [2021-12-19 20:29:03,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,806 INFO L229 MonitoredProcess]: Starting monitored process 245 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Waiting until timeout for monitored process [2021-12-19 20:29:03,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:03,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:03,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:03,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Ended with exit code 0 [2021-12-19 20:29:03,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,830 INFO L229 MonitoredProcess]: Starting monitored process 246 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Waiting until timeout for monitored process [2021-12-19 20:29:03,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:03,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:03,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:03,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Ended with exit code 0 [2021-12-19 20:29:03,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,854 INFO L229 MonitoredProcess]: Starting monitored process 247 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Waiting until timeout for monitored process [2021-12-19 20:29:03,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:03,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:03,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:03,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Ended with exit code 0 [2021-12-19 20:29:03,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,878 INFO L229 MonitoredProcess]: Starting monitored process 248 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Waiting until timeout for monitored process [2021-12-19 20:29:03,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:03,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:03,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:03,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Ended with exit code 0 [2021-12-19 20:29:03,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,901 INFO L229 MonitoredProcess]: Starting monitored process 249 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Waiting until timeout for monitored process [2021-12-19 20:29:03,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:03,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:03,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:03,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Ended with exit code 0 [2021-12-19 20:29:03,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,928 INFO L229 MonitoredProcess]: Starting monitored process 250 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Waiting until timeout for monitored process [2021-12-19 20:29:03,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:03,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:03,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:03,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,955 INFO L229 MonitoredProcess]: Starting monitored process 251 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Waiting until timeout for monitored process [2021-12-19 20:29:03,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:03,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:03,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:03,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:03,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Ended with exit code 0 [2021-12-19 20:29:03,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:03,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:03,978 INFO L229 MonitoredProcess]: Starting monitored process 252 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:03,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Waiting until timeout for monitored process [2021-12-19 20:29:03,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:03,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:03,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:03,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:03,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:03,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:03,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:03,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:03,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:04,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Ended with exit code 0 [2021-12-19 20:29:04,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:04,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:04,001 INFO L229 MonitoredProcess]: Starting monitored process 253 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:04,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Waiting until timeout for monitored process [2021-12-19 20:29:04,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:04,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:04,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:04,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:04,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:04,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:04,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:04,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:04,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:04,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Ended with exit code 0 [2021-12-19 20:29:04,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:04,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:04,027 INFO L229 MonitoredProcess]: Starting monitored process 254 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:04,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Waiting until timeout for monitored process [2021-12-19 20:29:04,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:04,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:04,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:04,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:04,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:04,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:04,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:04,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:04,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:04,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Ended with exit code 0 [2021-12-19 20:29:04,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:04,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:04,051 INFO L229 MonitoredProcess]: Starting monitored process 255 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:04,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Waiting until timeout for monitored process [2021-12-19 20:29:04,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:04,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:04,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:04,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:04,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:04,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:04,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:04,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:04,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:04,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:04,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:04,077 INFO L229 MonitoredProcess]: Starting monitored process 256 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:04,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Waiting until timeout for monitored process [2021-12-19 20:29:04,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:04,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:04,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:04,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:04,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:04,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:04,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:04,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:04,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:04,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:04,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:04,109 INFO L229 MonitoredProcess]: Starting monitored process 257 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:04,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Waiting until timeout for monitored process [2021-12-19 20:29:04,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:04,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:04,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:04,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:04,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:04,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:04,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:04,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:04,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Ended with exit code 0 [2021-12-19 20:29:04,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:04,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:04,134 INFO L229 MonitoredProcess]: Starting monitored process 258 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:04,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Waiting until timeout for monitored process [2021-12-19 20:29:04,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:04,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:04,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:04,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:04,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:04,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:04,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:04,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:04,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Ended with exit code 0 [2021-12-19 20:29:04,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:04,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:04,161 INFO L229 MonitoredProcess]: Starting monitored process 259 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:04,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Waiting until timeout for monitored process [2021-12-19 20:29:04,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:04,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:04,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:04,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:04,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:04,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:04,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:04,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:04,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Ended with exit code 0 [2021-12-19 20:29:04,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:04,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:04,189 INFO L229 MonitoredProcess]: Starting monitored process 260 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:04,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Waiting until timeout for monitored process [2021-12-19 20:29:04,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:04,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:04,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:04,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:04,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:04,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:04,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:04,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:04,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Ended with exit code 0 [2021-12-19 20:29:04,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:04,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:04,217 INFO L229 MonitoredProcess]: Starting monitored process 261 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:04,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Waiting until timeout for monitored process [2021-12-19 20:29:04,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:04,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:04,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:04,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:04,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:04,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:04,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:04,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:04,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:04,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:04,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:04,271 INFO L229 MonitoredProcess]: Starting monitored process 262 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:04,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:04,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:04,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:04,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:04,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:04,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:04,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:04,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Waiting until timeout for monitored process [2021-12-19 20:29:04,303 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:29:04,309 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 20:29:04,309 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-19 20:29:04,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:04,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:04,316 INFO L229 MonitoredProcess]: Starting monitored process 263 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:04,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Waiting until timeout for monitored process [2021-12-19 20:29:04,318 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:29:04,341 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:29:04,341 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:29:04,342 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 48))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 48))_2 Supporting invariants [] [2021-12-19 20:29:04,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Ended with exit code 0 [2021-12-19 20:29:04,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:05,702 INFO L297 tatePredicateManager]: 328 out of 330 supporting invariants were superfluous and have been removed [2021-12-19 20:29:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:05,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-19 20:29:05,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:06,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:29:06,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:06,371 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2021-12-19 20:29:06,371 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30 Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:06,404 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 98 states and 114 transitions. Complement of second has 4 states. [2021-12-19 20:29:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:29:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:29:06,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 81 letters. Loop has 2 letters. [2021-12-19 20:29:06,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:06,405 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:29:06,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:06,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-19 20:29:06,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:07,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:29:07,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:07,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.14 stem predicates 2 loop predicates [2021-12-19 20:29:07,037 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30 Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:07,086 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 98 states and 114 transitions. Complement of second has 4 states. [2021-12-19 20:29:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:29:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:29:07,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 81 letters. Loop has 2 letters. [2021-12-19 20:29:07,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:07,088 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:29:07,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:07,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-19 20:29:07,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:07,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:29:07,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:07,770 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2021-12-19 20:29:07,770 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30 Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:08,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 112 transitions. cyclomatic complexity: 30. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 123 states and 153 transitions. Complement of second has 32 states. [2021-12-19 20:29:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 14 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:29:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 95 transitions. [2021-12-19 20:29:08,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 95 transitions. Stem has 81 letters. Loop has 2 letters. [2021-12-19 20:29:08,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:08,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 95 transitions. Stem has 83 letters. Loop has 2 letters. [2021-12-19 20:29:08,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:08,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 95 transitions. Stem has 81 letters. Loop has 4 letters. [2021-12-19 20:29:08,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:08,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 153 transitions. [2021-12-19 20:29:08,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:29:08,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 118 states and 146 transitions. [2021-12-19 20:29:08,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:29:08,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:29:08,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 146 transitions. [2021-12-19 20:29:08,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:29:08,099 INFO L681 BuchiCegarLoop]: Abstraction has 118 states and 146 transitions. [2021-12-19 20:29:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 146 transitions. [2021-12-19 20:29:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2021-12-19 20:29:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.1568627450980393) internal successors, (118), 101 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2021-12-19 20:29:08,101 INFO L704 BuchiCegarLoop]: Abstraction has 102 states and 118 transitions. [2021-12-19 20:29:08,101 INFO L587 BuchiCegarLoop]: Abstraction has 102 states and 118 transitions. [2021-12-19 20:29:08,101 INFO L425 BuchiCegarLoop]: ======== Iteration 32============ [2021-12-19 20:29:08,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 118 transitions. [2021-12-19 20:29:08,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:29:08,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:08,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:08,102 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:08,102 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:29:08,103 INFO L791 eck$LassoCheckResult]: Stem: 28860#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 28861#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 28862#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 28855#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 28856#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28857#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28858#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28859#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28863#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28896#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28895#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28894#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28893#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28892#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28891#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28890#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28889#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28888#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28887#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28886#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28885#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28884#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28883#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28882#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28881#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28880#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28879#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28878#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28877#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 28876#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 28875#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 28868#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 28864#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28865#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28955#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28954#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28866#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28867#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28873#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28869#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28870#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28952#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28951#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28950#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28949#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28947#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28946#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28945#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28944#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28942#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28941#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28940#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28939#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28937#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28936#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28935#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28934#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28932#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28931#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28930#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28929#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28927#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28926#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28925#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28924#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28922#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28921#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28920#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28919#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28917#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28916#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28915#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28914#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28912#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28911#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28910#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28909#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28907#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28906#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28905#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28904#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28903#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28900#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 28899#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 28897#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 28871#L517-3 [2021-12-19 20:29:08,103 INFO L793 eck$LassoCheckResult]: Loop: 28871#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 28872#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 28871#L517-3 [2021-12-19 20:29:08,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:08,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1350688567, now seen corresponding path program 29 times [2021-12-19 20:29:08,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:08,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951584097] [2021-12-19 20:29:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:08,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 276 proven. 218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:08,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:29:08,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951584097] [2021-12-19 20:29:08,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951584097] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:29:08,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791931044] [2021-12-19 20:29:08,425 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 20:29:08,425 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:29:08,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:08,426 INFO L229 MonitoredProcess]: Starting monitored process 264 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:29:08,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (264)] Waiting until timeout for monitored process [2021-12-19 20:29:08,671 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2021-12-19 20:29:08,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:29:08,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-19 20:29:08,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 325 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:09,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:29:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 325 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:09,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791931044] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:29:09,348 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:29:09,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 46 [2021-12-19 20:29:09,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249810449] [2021-12-19 20:29:09,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:29:09,349 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:29:09,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:09,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 29 times [2021-12-19 20:29:09,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:09,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656292226] [2021-12-19 20:29:09,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:09,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:09,354 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:09,356 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:09,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:29:09,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-19 20:29:09,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1677, Unknown=0, NotChecked=0, Total=2162 [2021-12-19 20:29:09,394 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. cyclomatic complexity: 32 Second operand has 47 states, 46 states have (on average 3.1956521739130435) internal successors, (147), 47 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:29:09,817 INFO L93 Difference]: Finished difference Result 172 states and 201 transitions. [2021-12-19 20:29:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-19 20:29:09,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 201 transitions. [2021-12-19 20:29:09,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:29:09,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 105 states and 121 transitions. [2021-12-19 20:29:09,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:29:09,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:29:09,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 121 transitions. [2021-12-19 20:29:09,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:29:09,819 INFO L681 BuchiCegarLoop]: Abstraction has 105 states and 121 transitions. [2021-12-19 20:29:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 121 transitions. [2021-12-19 20:29:09,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-12-19 20:29:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.1538461538461537) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2021-12-19 20:29:09,820 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 120 transitions. [2021-12-19 20:29:09,821 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 120 transitions. [2021-12-19 20:29:09,821 INFO L425 BuchiCegarLoop]: ======== Iteration 33============ [2021-12-19 20:29:09,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 120 transitions. [2021-12-19 20:29:09,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:29:09,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:09,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:09,822 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:09,822 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:29:09,822 INFO L791 eck$LassoCheckResult]: Stem: 29718#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 29719#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 29720#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 29713#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 29714#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29715#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29716#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29717#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29721#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29759#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29758#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29757#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29756#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29755#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29754#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29753#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29752#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29751#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29750#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29749#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29748#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29747#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29746#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29745#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29744#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29743#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29742#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29741#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29740#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29739#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29738#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 29733#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 29732#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 29727#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 29722#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29723#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29730#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29726#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29724#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29725#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29815#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29814#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29813#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29811#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29810#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29809#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29808#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29806#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29805#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29804#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29803#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29801#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29800#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29799#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29798#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29796#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29795#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29794#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29793#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29791#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29790#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29789#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29788#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29786#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29785#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29784#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29783#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29781#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29780#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29779#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29778#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29776#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29775#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29774#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29773#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29771#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29770#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29769#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29768#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29766#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29765#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29764#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29763#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29762#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29737#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 29736#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 29734#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 29728#L517-3 [2021-12-19 20:29:09,822 INFO L793 eck$LassoCheckResult]: Loop: 29728#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 29729#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 29728#L517-3 [2021-12-19 20:29:09,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1263422425, now seen corresponding path program 30 times [2021-12-19 20:29:09,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:09,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396878477] [2021-12-19 20:29:09,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:09,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:09,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:09,872 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 30 times [2021-12-19 20:29:09,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:09,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838371853] [2021-12-19 20:29:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:09,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:09,877 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:09,879 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1326795500, now seen corresponding path program 16 times [2021-12-19 20:29:09,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:09,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902544120] [2021-12-19 20:29:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:09,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:09,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:09,931 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:37,139 WARN L227 SmtUtils]: Spent 27.17s on a formula simplification. DAG size of input: 516 DAG size of output: 339 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:29:38,049 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:29:38,049 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:29:38,049 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:29:38,049 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:29:38,049 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:29:38,050 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:38,050 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:29:38,050 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:29:38,050 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration33_Lasso [2021-12-19 20:29:38,050 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:29:38,050 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:29:38,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:38,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:38,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:38,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:38,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:38,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:38,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:38,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:38,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:38,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:38,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:38,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:39,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:39,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:39,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:39,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:39,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:39,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:29:40,456 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:29:40,456 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:29:40,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,458 INFO L229 MonitoredProcess]: Starting monitored process 265 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Waiting until timeout for monitored process [2021-12-19 20:29:40,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Ended with exit code 0 [2021-12-19 20:29:40,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,488 INFO L229 MonitoredProcess]: Starting monitored process 266 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Waiting until timeout for monitored process [2021-12-19 20:29:40,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:40,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:40,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:40,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Ended with exit code 0 [2021-12-19 20:29:40,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,512 INFO L229 MonitoredProcess]: Starting monitored process 267 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Waiting until timeout for monitored process [2021-12-19 20:29:40,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Ended with exit code 0 [2021-12-19 20:29:40,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,538 INFO L229 MonitoredProcess]: Starting monitored process 268 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Waiting until timeout for monitored process [2021-12-19 20:29:40,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:40,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:40,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:40,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Ended with exit code 0 [2021-12-19 20:29:40,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,563 INFO L229 MonitoredProcess]: Starting monitored process 269 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Waiting until timeout for monitored process [2021-12-19 20:29:40,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Ended with exit code 0 [2021-12-19 20:29:40,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,589 INFO L229 MonitoredProcess]: Starting monitored process 270 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Waiting until timeout for monitored process [2021-12-19 20:29:40,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:40,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:40,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:40,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:40,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,614 INFO L229 MonitoredProcess]: Starting monitored process 271 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Waiting until timeout for monitored process [2021-12-19 20:29:40,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:40,640 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,641 INFO L229 MonitoredProcess]: Starting monitored process 272 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Waiting until timeout for monitored process [2021-12-19 20:29:40,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:40,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:40,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:40,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Ended with exit code 0 [2021-12-19 20:29:40,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,665 INFO L229 MonitoredProcess]: Starting monitored process 273 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Waiting until timeout for monitored process [2021-12-19 20:29:40,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:40,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:40,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:40,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:40,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,690 INFO L229 MonitoredProcess]: Starting monitored process 274 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Waiting until timeout for monitored process [2021-12-19 20:29:40,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:40,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:40,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:40,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Ended with exit code 0 [2021-12-19 20:29:40,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,715 INFO L229 MonitoredProcess]: Starting monitored process 275 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Waiting until timeout for monitored process [2021-12-19 20:29:40,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:29:40,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:29:40,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:29:40,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Ended with exit code 0 [2021-12-19 20:29:40,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,739 INFO L229 MonitoredProcess]: Starting monitored process 276 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Waiting until timeout for monitored process [2021-12-19 20:29:40,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Ended with exit code 0 [2021-12-19 20:29:40,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,768 INFO L229 MonitoredProcess]: Starting monitored process 277 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Waiting until timeout for monitored process [2021-12-19 20:29:40,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:40,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,797 INFO L229 MonitoredProcess]: Starting monitored process 278 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Waiting until timeout for monitored process [2021-12-19 20:29:40,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:40,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,828 INFO L229 MonitoredProcess]: Starting monitored process 279 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Waiting until timeout for monitored process [2021-12-19 20:29:40,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:40,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,855 INFO L229 MonitoredProcess]: Starting monitored process 280 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Waiting until timeout for monitored process [2021-12-19 20:29:40,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:40,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,892 INFO L229 MonitoredProcess]: Starting monitored process 281 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Waiting until timeout for monitored process [2021-12-19 20:29:40,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Ended with exit code 0 [2021-12-19 20:29:40,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,921 INFO L229 MonitoredProcess]: Starting monitored process 282 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Waiting until timeout for monitored process [2021-12-19 20:29:40,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Ended with exit code 0 [2021-12-19 20:29:40,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,951 INFO L229 MonitoredProcess]: Starting monitored process 283 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Waiting until timeout for monitored process [2021-12-19 20:29:40,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:40,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Ended with exit code 0 [2021-12-19 20:29:40,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:40,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:40,980 INFO L229 MonitoredProcess]: Starting monitored process 284 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:40,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Waiting until timeout for monitored process [2021-12-19 20:29:40,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:40,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:40,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:40,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:40,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:40,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:40,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:40,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:41,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Ended with exit code 0 [2021-12-19 20:29:41,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:41,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:41,012 INFO L229 MonitoredProcess]: Starting monitored process 285 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:41,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Waiting until timeout for monitored process [2021-12-19 20:29:41,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:41,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:41,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:41,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:41,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:41,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:41,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:41,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:41,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Ended with exit code 0 [2021-12-19 20:29:41,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:41,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:41,041 INFO L229 MonitoredProcess]: Starting monitored process 286 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:41,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Waiting until timeout for monitored process [2021-12-19 20:29:41,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:41,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:41,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:41,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:41,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:41,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:41,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:41,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:41,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Ended with exit code 0 [2021-12-19 20:29:41,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:41,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:41,070 INFO L229 MonitoredProcess]: Starting monitored process 287 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:41,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Waiting until timeout for monitored process [2021-12-19 20:29:41,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:41,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:41,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:41,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:41,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:41,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:41,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:41,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:29:41,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Ended with exit code 0 [2021-12-19 20:29:41,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:41,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:41,098 INFO L229 MonitoredProcess]: Starting monitored process 288 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:41,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Waiting until timeout for monitored process [2021-12-19 20:29:41,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:29:41,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:29:41,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:29:41,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:29:41,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:29:41,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:29:41,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:29:41,114 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:29:41,119 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-19 20:29:41,119 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-19 20:29:41,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:29:41,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:41,120 INFO L229 MonitoredProcess]: Starting monitored process 289 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:29:41,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Waiting until timeout for monitored process [2021-12-19 20:29:41,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:29:41,128 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:29:41,128 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:29:41,129 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* ULTIMATE.start_main_~k~0#1 4) ULTIMATE.start_main_~numbers~0#1.offset (- 4)))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* ULTIMATE.start_main_~k~0#1 4) ULTIMATE.start_main_~numbers~0#1.offset (- 4)))_3 Supporting invariants [] [2021-12-19 20:29:41,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Ended with exit code 0 [2021-12-19 20:29:41,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Forceful destruction successful, exit code 0 [2021-12-19 20:29:42,861 INFO L297 tatePredicateManager]: 380 out of 382 supporting invariants were superfluous and have been removed [2021-12-19 20:29:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:42,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 20:29:42,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:44,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:29:44,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:44,050 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.30 stem predicates 2 loop predicates [2021-12-19 20:29:44,050 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 120 transitions. cyclomatic complexity: 32 Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:44,382 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 120 transitions. cyclomatic complexity: 32. Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 110 states and 128 transitions. Complement of second has 19 states. [2021-12-19 20:29:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 17 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:29:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2021-12-19 20:29:44,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 42 transitions. Stem has 87 letters. Loop has 2 letters. [2021-12-19 20:29:44,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:44,383 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:29:44,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:44,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 20:29:44,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:45,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:29:45,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:45,574 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.30 stem predicates 2 loop predicates [2021-12-19 20:29:45,574 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 120 transitions. cyclomatic complexity: 32 Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:45,922 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 120 transitions. cyclomatic complexity: 32. Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 110 states and 128 transitions. Complement of second has 19 states. [2021-12-19 20:29:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 17 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:29:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2021-12-19 20:29:45,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 42 transitions. Stem has 87 letters. Loop has 2 letters. [2021-12-19 20:29:45,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:45,923 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:29:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:45,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 20:29:45,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:47,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:29:47,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:29:47,128 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.30 stem predicates 2 loop predicates [2021-12-19 20:29:47,128 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 120 transitions. cyclomatic complexity: 32 Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:48,134 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 120 transitions. cyclomatic complexity: 32. Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 221 states and 282 transitions. Complement of second has 50 states. [2021-12-19 20:29:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 34 states 30 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:29:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 139 transitions. [2021-12-19 20:29:48,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 139 transitions. Stem has 87 letters. Loop has 2 letters. [2021-12-19 20:29:48,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:48,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 139 transitions. Stem has 89 letters. Loop has 2 letters. [2021-12-19 20:29:48,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:48,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 139 transitions. Stem has 87 letters. Loop has 4 letters. [2021-12-19 20:29:48,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:29:48,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 282 transitions. [2021-12-19 20:29:48,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-19 20:29:48,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 216 states and 275 transitions. [2021-12-19 20:29:48,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-19 20:29:48,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-19 20:29:48,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 275 transitions. [2021-12-19 20:29:48,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:29:48,138 INFO L681 BuchiCegarLoop]: Abstraction has 216 states and 275 transitions. [2021-12-19 20:29:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 275 transitions. [2021-12-19 20:29:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 113. [2021-12-19 20:29:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 112 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2021-12-19 20:29:48,140 INFO L704 BuchiCegarLoop]: Abstraction has 113 states and 131 transitions. [2021-12-19 20:29:48,140 INFO L587 BuchiCegarLoop]: Abstraction has 113 states and 131 transitions. [2021-12-19 20:29:48,140 INFO L425 BuchiCegarLoop]: ======== Iteration 34============ [2021-12-19 20:29:48,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 131 transitions. [2021-12-19 20:29:48,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:29:48,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:48,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:48,141 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:48,141 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:29:48,141 INFO L791 eck$LassoCheckResult]: Stem: 32858#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 32859#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 32860#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 32853#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 32854#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32855#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32856#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32857#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32861#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32896#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32895#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32894#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32893#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32892#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32891#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32890#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32889#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32888#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32887#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32886#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32885#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32884#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32883#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32882#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32881#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32880#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32879#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32878#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32877#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32876#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32874#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32875#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32965#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 32873#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 32872#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 32867#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 32862#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32863#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32870#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32865#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32866#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32957#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32956#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32955#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32954#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32952#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32951#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32950#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32949#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32947#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32946#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32945#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32944#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32942#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32941#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32940#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32939#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32937#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32936#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32935#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32934#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32932#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32931#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32930#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32929#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32927#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32926#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32925#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32924#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32922#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32921#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32920#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32919#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32917#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32916#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32915#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32914#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32912#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32911#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32910#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32909#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32907#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32906#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32905#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32904#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32903#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32900#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 32899#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 32897#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 32868#L517-3 [2021-12-19 20:29:48,142 INFO L793 eck$LassoCheckResult]: Loop: 32868#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 32869#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 32868#L517-3 [2021-12-19 20:29:48,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash 994961413, now seen corresponding path program 31 times [2021-12-19 20:29:48,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:48,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068962898] [2021-12-19 20:29:48,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:48,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:48,168 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:48,193 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:48,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:48,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 31 times [2021-12-19 20:29:48,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:48,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303854540] [2021-12-19 20:29:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:48,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:48,198 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:48,201 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:48,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:48,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1619787958, now seen corresponding path program 17 times [2021-12-19 20:29:48,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:48,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902800012] [2021-12-19 20:29:48,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:48,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:48,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:48,264 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:30:16,106 WARN L227 SmtUtils]: Spent 27.81s on a formula simplification. DAG size of input: 533 DAG size of output: 350 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:30:17,201 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:30:17,201 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:30:17,201 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:30:17,201 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:30:17,201 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:30:17,201 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:17,201 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:30:17,201 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:30:17,201 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration34_Lasso [2021-12-19 20:30:17,201 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:30:17,201 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:30:17,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:17,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:17,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:17,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:19,753 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:30:19,753 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:30:19,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:19,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:19,754 INFO L229 MonitoredProcess]: Starting monitored process 290 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:19,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Waiting until timeout for monitored process [2021-12-19 20:30:19,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:19,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:19,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:30:19,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:19,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:19,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:19,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:30:19,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:30:19,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:19,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Ended with exit code 0 [2021-12-19 20:30:19,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:19,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:19,782 INFO L229 MonitoredProcess]: Starting monitored process 291 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:19,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Waiting until timeout for monitored process [2021-12-19 20:30:19,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:19,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:19,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:19,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:19,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:19,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:19,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:19,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:19,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Ended with exit code 0 [2021-12-19 20:30:19,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:19,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:19,809 INFO L229 MonitoredProcess]: Starting monitored process 292 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:19,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Waiting until timeout for monitored process [2021-12-19 20:30:19,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:19,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:19,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:30:19,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:19,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:19,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:19,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:30:19,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:30:19,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:19,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Ended with exit code 0 [2021-12-19 20:30:19,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:19,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:19,833 INFO L229 MonitoredProcess]: Starting monitored process 293 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:19,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Waiting until timeout for monitored process [2021-12-19 20:30:19,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:19,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:19,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:19,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:19,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:19,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:19,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:19,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:19,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Ended with exit code 0 [2021-12-19 20:30:19,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:19,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:19,863 INFO L229 MonitoredProcess]: Starting monitored process 294 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:19,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Waiting until timeout for monitored process [2021-12-19 20:30:19,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:19,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:19,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:19,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:19,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:19,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:19,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:19,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:19,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Forceful destruction successful, exit code 0 [2021-12-19 20:30:19,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:19,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:19,892 INFO L229 MonitoredProcess]: Starting monitored process 295 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:19,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Waiting until timeout for monitored process [2021-12-19 20:30:19,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:19,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:19,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:19,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:19,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:19,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:19,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:19,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:19,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Ended with exit code 0 [2021-12-19 20:30:19,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:19,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:19,921 INFO L229 MonitoredProcess]: Starting monitored process 296 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:19,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Waiting until timeout for monitored process [2021-12-19 20:30:19,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:19,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:19,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:19,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:19,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:19,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:19,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:19,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:19,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Ended with exit code 0 [2021-12-19 20:30:19,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:19,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:19,950 INFO L229 MonitoredProcess]: Starting monitored process 297 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:19,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Waiting until timeout for monitored process [2021-12-19 20:30:19,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:19,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:19,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:19,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:19,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:19,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:19,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:19,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:19,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Ended with exit code 0 [2021-12-19 20:30:19,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:19,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:19,987 INFO L229 MonitoredProcess]: Starting monitored process 298 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:19,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Waiting until timeout for monitored process [2021-12-19 20:30:19,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:19,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:19,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:19,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:19,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:19,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:19,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:20,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:20,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Ended with exit code 0 [2021-12-19 20:30:20,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:20,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:20,017 INFO L229 MonitoredProcess]: Starting monitored process 299 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:20,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Waiting until timeout for monitored process [2021-12-19 20:30:20,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:20,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:20,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:20,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:20,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:20,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:20,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:20,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:20,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Ended with exit code 0 [2021-12-19 20:30:20,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:20,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:20,046 INFO L229 MonitoredProcess]: Starting monitored process 300 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:20,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Waiting until timeout for monitored process [2021-12-19 20:30:20,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:20,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:20,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:20,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:20,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:20,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:20,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:20,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:20,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Forceful destruction successful, exit code 0 [2021-12-19 20:30:20,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:20,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:20,073 INFO L229 MonitoredProcess]: Starting monitored process 301 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:20,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Waiting until timeout for monitored process [2021-12-19 20:30:20,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:20,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:20,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:20,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:20,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:20,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:20,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:20,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:20,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Forceful destruction successful, exit code 0 [2021-12-19 20:30:20,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:20,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:20,103 INFO L229 MonitoredProcess]: Starting monitored process 302 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:20,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Waiting until timeout for monitored process [2021-12-19 20:30:20,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:20,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:20,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:20,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:20,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:20,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:20,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:20,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:20,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Ended with exit code 0 [2021-12-19 20:30:20,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:20,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:20,131 INFO L229 MonitoredProcess]: Starting monitored process 303 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:20,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Waiting until timeout for monitored process [2021-12-19 20:30:20,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:20,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:20,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:20,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:20,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:20,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:20,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:20,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:30:20,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (303)] Ended with exit code 0 [2021-12-19 20:30:20,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:20,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:20,168 INFO L229 MonitoredProcess]: Starting monitored process 304 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:20,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Waiting until timeout for monitored process [2021-12-19 20:30:20,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:30:20,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:30:20,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:30:20,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:30:20,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:30:20,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:30:20,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:30:20,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:30:20,188 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-19 20:30:20,188 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-19 20:30:20,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:20,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:20,189 INFO L229 MonitoredProcess]: Starting monitored process 305 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:30:20,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Waiting until timeout for monitored process [2021-12-19 20:30:20,190 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:30:20,197 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:30:20,197 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:30:20,197 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 52))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 52))_1 Supporting invariants [] [2021-12-19 20:30:20,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Ended with exit code 0 [2021-12-19 20:30:20,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Forceful destruction successful, exit code 0 [2021-12-19 20:30:22,019 INFO L297 tatePredicateManager]: 408 out of 410 supporting invariants were superfluous and have been removed [2021-12-19 20:30:22,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:30:22,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-19 20:30:22,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:30:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:30:22,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:30:22,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:30:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:30:22,706 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.15 stem predicates 2 loop predicates [2021-12-19 20:30:22,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 131 transitions. cyclomatic complexity: 35 Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:30:22,741 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 131 transitions. cyclomatic complexity: 35. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 115 states and 135 transitions. Complement of second has 4 states. [2021-12-19 20:30:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:30:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:30:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:30:22,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 89 letters. Loop has 2 letters. [2021-12-19 20:30:22,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:30:22,742 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:30:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:30:22,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-19 20:30:22,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:30:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:30:23,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:30:23,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:30:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:30:23,438 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.15 stem predicates 2 loop predicates [2021-12-19 20:30:23,438 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 131 transitions. cyclomatic complexity: 35 Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:30:23,472 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 131 transitions. cyclomatic complexity: 35. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 115 states and 135 transitions. Complement of second has 4 states. [2021-12-19 20:30:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:30:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:30:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:30:23,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 89 letters. Loop has 2 letters. [2021-12-19 20:30:23,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:30:23,476 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:30:23,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:30:23,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-19 20:30:23,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:30:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:30:24,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:30:24,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:30:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:30:24,181 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.15 stem predicates 2 loop predicates [2021-12-19 20:30:24,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 131 transitions. cyclomatic complexity: 35 Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:30:24,566 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 131 transitions. cyclomatic complexity: 35. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 218 states and 279 transitions. Complement of second has 34 states. [2021-12-19 20:30:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 15 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:30:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:30:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 101 transitions. [2021-12-19 20:30:24,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 101 transitions. Stem has 89 letters. Loop has 2 letters. [2021-12-19 20:30:24,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:30:24,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 101 transitions. Stem has 91 letters. Loop has 2 letters. [2021-12-19 20:30:24,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:30:24,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 101 transitions. Stem has 89 letters. Loop has 4 letters. [2021-12-19 20:30:24,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:30:24,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 279 transitions. [2021-12-19 20:30:24,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:30:24,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 211 states and 269 transitions. [2021-12-19 20:30:24,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-19 20:30:24,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-19 20:30:24,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 269 transitions. [2021-12-19 20:30:24,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:30:24,570 INFO L681 BuchiCegarLoop]: Abstraction has 211 states and 269 transitions. [2021-12-19 20:30:24,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 269 transitions. [2021-12-19 20:30:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 109. [2021-12-19 20:30:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.1559633027522935) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:30:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2021-12-19 20:30:24,572 INFO L704 BuchiCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-12-19 20:30:24,572 INFO L587 BuchiCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-12-19 20:30:24,573 INFO L425 BuchiCegarLoop]: ======== Iteration 35============ [2021-12-19 20:30:24,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 126 transitions. [2021-12-19 20:30:24,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:30:24,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:30:24,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:30:24,574 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2021-12-19 20:30:24,574 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:30:24,574 INFO L791 eck$LassoCheckResult]: Stem: 36008#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 36009#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 36010#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 36003#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 36004#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36005#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36006#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36007#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36011#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36049#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36048#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36047#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36046#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36045#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36044#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36043#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36042#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36041#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36040#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36039#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36038#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36037#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36036#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36035#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36034#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36033#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36032#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36031#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36030#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36029#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36028#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36024#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36023#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 36018#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 36012#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36013#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36110#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36109#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36014#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36015#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36022#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36016#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36017#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36107#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36106#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36105#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36104#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36102#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36101#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36100#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36099#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36097#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36096#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36095#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36094#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36092#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36091#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36090#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36089#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36087#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36086#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36085#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36084#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36082#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36081#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36080#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36079#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36077#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36076#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36075#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36074#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36072#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36071#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36070#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36069#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36067#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36066#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36065#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36064#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36062#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36061#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36060#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36059#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36057#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36056#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36055#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36054#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36051#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36050#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36027#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36025#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36020#L517-3 [2021-12-19 20:30:24,574 INFO L793 eck$LassoCheckResult]: Loop: 36020#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36019#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 36020#L517-3 [2021-12-19 20:30:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash -554811908, now seen corresponding path program 32 times [2021-12-19 20:30:24,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:30:24,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758940651] [2021-12-19 20:30:24,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:30:24,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:30:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:30:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 325 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:30:24,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:30:24,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758940651] [2021-12-19 20:30:24,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758940651] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:30:24,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534089441] [2021-12-19 20:30:24,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:30:24,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:30:24,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:24,920 INFO L229 MonitoredProcess]: Starting monitored process 306 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:30:24,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (306)] Waiting until timeout for monitored process [2021-12-19 20:30:25,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:30:25,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:30:25,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-19 20:30:25,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:30:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 378 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:30:25,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:30:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 378 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:30:25,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534089441] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:30:25,811 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:30:25,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 49 [2021-12-19 20:30:25,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642176567] [2021-12-19 20:30:25,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:30:25,812 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:30:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 32 times [2021-12-19 20:30:25,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:30:25,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934989598] [2021-12-19 20:30:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:30:25,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:30:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:25,820 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:30:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:25,823 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:30:25,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:30:25,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-19 20:30:25,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2021-12-19 20:30:25,862 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. cyclomatic complexity: 34 Second operand has 50 states, 49 states have (on average 3.204081632653061) internal successors, (157), 50 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:30:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:30:26,304 INFO L93 Difference]: Finished difference Result 184 states and 215 transitions. [2021-12-19 20:30:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-19 20:30:26,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 215 transitions. [2021-12-19 20:30:26,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:30:26,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 112 states and 129 transitions. [2021-12-19 20:30:26,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:30:26,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:30:26,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 129 transitions. [2021-12-19 20:30:26,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:30:26,307 INFO L681 BuchiCegarLoop]: Abstraction has 112 states and 129 transitions. [2021-12-19 20:30:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 129 transitions. [2021-12-19 20:30:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2021-12-19 20:30:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 110 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:30:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2021-12-19 20:30:26,308 INFO L704 BuchiCegarLoop]: Abstraction has 111 states and 128 transitions. [2021-12-19 20:30:26,309 INFO L587 BuchiCegarLoop]: Abstraction has 111 states and 128 transitions. [2021-12-19 20:30:26,309 INFO L425 BuchiCegarLoop]: ======== Iteration 36============ [2021-12-19 20:30:26,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 128 transitions. [2021-12-19 20:30:26,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:30:26,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:30:26,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:30:26,310 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2021-12-19 20:30:26,310 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:30:26,310 INFO L791 eck$LassoCheckResult]: Stem: 36926#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 36927#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 36928#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 36921#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 36922#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36923#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36924#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36925#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36929#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36969#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36968#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36967#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36966#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36965#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36964#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36963#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36962#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36961#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36960#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36959#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36958#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36957#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36956#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36955#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36954#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36953#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36952#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36951#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36950#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36949#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36948#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36947#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36946#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 36941#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 36940#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 36935#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 36930#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36931#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36938#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36934#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36932#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36933#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 37030#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 37029#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 37028#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 37026#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 37025#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 37024#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 37023#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 37021#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 37020#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 37019#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 37018#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 37016#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 37015#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 37014#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 37013#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 37011#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 37010#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 37009#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 37008#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 37006#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 37005#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 37004#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 37003#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 37001#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 37000#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36999#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36998#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36996#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36995#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36994#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36993#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36991#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36990#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36989#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36988#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36986#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36985#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36984#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36983#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36981#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36980#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36979#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36978#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36976#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36975#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36974#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36973#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36972#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36945#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 36944#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 36942#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 36936#L517-3 [2021-12-19 20:30:26,310 INFO L793 eck$LassoCheckResult]: Loop: 36936#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 36937#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 36936#L517-3 [2021-12-19 20:30:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1838066982, now seen corresponding path program 33 times [2021-12-19 20:30:26,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:30:26,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356693822] [2021-12-19 20:30:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:30:26,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:30:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:26,339 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:30:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:26,367 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:30:26,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 33 times [2021-12-19 20:30:26,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:30:26,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449971686] [2021-12-19 20:30:26,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:30:26,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:30:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:26,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:30:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:26,375 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:30:26,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1150809889, now seen corresponding path program 18 times [2021-12-19 20:30:26,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:30:26,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929479937] [2021-12-19 20:30:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:30:26,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:30:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:26,403 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:30:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:26,434 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:30:52,713 WARN L227 SmtUtils]: Spent 26.24s on a formula simplification. DAG size of input: 549 DAG size of output: 365 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:30:54,771 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:30:54,771 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:30:54,771 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:30:54,771 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:30:54,771 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:30:54,771 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:30:54,771 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:30:54,771 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:30:54,771 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration36_Lasso [2021-12-19 20:30:54,771 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:30:54,771 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:30:54,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:30:54,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:04,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:04,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:04,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:04,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:04,727 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:31:04,728 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:31:04,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:04,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:04,736 INFO L229 MonitoredProcess]: Starting monitored process 307 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:04,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Waiting until timeout for monitored process [2021-12-19 20:31:04,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:04,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:04,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:31:04,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:04,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:04,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:04,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:31:04,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:31:04,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:04,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Forceful destruction successful, exit code 0 [2021-12-19 20:31:04,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:04,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:04,785 INFO L229 MonitoredProcess]: Starting monitored process 308 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:04,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:04,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:04,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:04,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:04,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:04,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:31:04,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:31:04,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Waiting until timeout for monitored process [2021-12-19 20:31:04,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:04,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Forceful destruction successful, exit code 0 [2021-12-19 20:31:04,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:04,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:04,840 INFO L229 MonitoredProcess]: Starting monitored process 309 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:04,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:04,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:04,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:31:04,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:04,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:04,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:04,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:31:04,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:31:04,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Waiting until timeout for monitored process [2021-12-19 20:31:04,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:04,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Forceful destruction successful, exit code 0 [2021-12-19 20:31:04,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:04,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:04,891 INFO L229 MonitoredProcess]: Starting monitored process 310 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:04,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:04,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Waiting until timeout for monitored process [2021-12-19 20:31:04,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:04,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:04,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:04,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:04,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:31:04,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:31:04,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:04,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Forceful destruction successful, exit code 0 [2021-12-19 20:31:04,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:04,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:04,951 INFO L229 MonitoredProcess]: Starting monitored process 311 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:04,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (311)] Waiting until timeout for monitored process [2021-12-19 20:31:04,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:04,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:04,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:31:04,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:04,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:04,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:04,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:31:04,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:31:04,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (311)] Forceful destruction successful, exit code 0 [2021-12-19 20:31:05,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,011 INFO L229 MonitoredProcess]: Starting monitored process 312 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:31:05,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:31:05,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:31:05,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (312)] Waiting until timeout for monitored process [2021-12-19 20:31:05,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (312)] Forceful destruction successful, exit code 0 [2021-12-19 20:31:05,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,063 INFO L229 MonitoredProcess]: Starting monitored process 313 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (313)] Waiting until timeout for monitored process [2021-12-19 20:31:05,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:31:05,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:31:05,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:31:05,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (313)] Ended with exit code 0 [2021-12-19 20:31:05,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,092 INFO L229 MonitoredProcess]: Starting monitored process 314 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (314)] Waiting until timeout for monitored process [2021-12-19 20:31:05,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:31:05,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:31:05,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (314)] Ended with exit code 0 [2021-12-19 20:31:05,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,118 INFO L229 MonitoredProcess]: Starting monitored process 315 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (315)] Waiting until timeout for monitored process [2021-12-19 20:31:05,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:31:05,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:31:05,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (315)] Ended with exit code 0 [2021-12-19 20:31:05,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,145 INFO L229 MonitoredProcess]: Starting monitored process 316 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (316)] Waiting until timeout for monitored process [2021-12-19 20:31:05,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:31:05,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:31:05,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:31:05,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (316)] Ended with exit code 0 [2021-12-19 20:31:05,169 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,169 INFO L229 MonitoredProcess]: Starting monitored process 317 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (317)] Waiting until timeout for monitored process [2021-12-19 20:31:05,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:31:05,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:31:05,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:31:05,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (317)] Ended with exit code 0 [2021-12-19 20:31:05,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,194 INFO L229 MonitoredProcess]: Starting monitored process 318 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (318)] Waiting until timeout for monitored process [2021-12-19 20:31:05,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:31:05,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:31:05,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (318)] Ended with exit code 0 [2021-12-19 20:31:05,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,221 INFO L229 MonitoredProcess]: Starting monitored process 319 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (319)] Waiting until timeout for monitored process [2021-12-19 20:31:05,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:31:05,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:31:05,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:31:05,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (319)] Ended with exit code 0 [2021-12-19 20:31:05,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,246 INFO L229 MonitoredProcess]: Starting monitored process 320 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (320)] Waiting until timeout for monitored process [2021-12-19 20:31:05,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:31:05,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:31:05,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (320)] Ended with exit code 0 [2021-12-19 20:31:05,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,272 INFO L229 MonitoredProcess]: Starting monitored process 321 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (321)] Waiting until timeout for monitored process [2021-12-19 20:31:05,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:31:05,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:31:05,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (321)] Forceful destruction successful, exit code 0 [2021-12-19 20:31:05,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,302 INFO L229 MonitoredProcess]: Starting monitored process 322 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (322)] Waiting until timeout for monitored process [2021-12-19 20:31:05,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:31:05,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:31:05,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (322)] Ended with exit code 0 [2021-12-19 20:31:05,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,331 INFO L229 MonitoredProcess]: Starting monitored process 323 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (323)] Waiting until timeout for monitored process [2021-12-19 20:31:05,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:31:05,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:31:05,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:31:05,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (323)] Ended with exit code 0 [2021-12-19 20:31:05,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,361 INFO L229 MonitoredProcess]: Starting monitored process 324 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (324)] Waiting until timeout for monitored process [2021-12-19 20:31:05,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:31:05,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:31:05,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:31:05,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:31:05,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:31:05,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:31:05,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:31:05,375 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:31:05,381 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-19 20:31:05,381 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-19 20:31:05,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:05,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:05,382 INFO L229 MonitoredProcess]: Starting monitored process 325 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:31:05,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (325)] Waiting until timeout for monitored process [2021-12-19 20:31:05,384 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:31:05,391 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:31:05,391 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:31:05,391 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 56))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 56))_1 Supporting invariants [] [2021-12-19 20:31:05,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (324)] Ended with exit code 0 [2021-12-19 20:31:05,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (325)] Ended with exit code 0 [2021-12-19 20:31:07,369 INFO L297 tatePredicateManager]: 438 out of 440 supporting invariants were superfluous and have been removed [2021-12-19 20:31:07,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:31:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:31:07,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-19 20:31:07,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:31:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:31:08,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:31:08,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:31:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:31:08,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.16 stem predicates 2 loop predicates [2021-12-19 20:31:08,119 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 128 transitions. cyclomatic complexity: 34 Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:31:08,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 128 transitions. cyclomatic complexity: 34. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 112 states and 130 transitions. Complement of second has 4 states. [2021-12-19 20:31:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:31:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:31:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:31:08,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 93 letters. Loop has 2 letters. [2021-12-19 20:31:08,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:31:08,156 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:31:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:31:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:31:08,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-19 20:31:08,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:31:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:31:08,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:31:08,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:31:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:31:08,877 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.16 stem predicates 2 loop predicates [2021-12-19 20:31:08,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 128 transitions. cyclomatic complexity: 34 Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:31:08,913 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 128 transitions. cyclomatic complexity: 34. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 112 states and 130 transitions. Complement of second has 4 states. [2021-12-19 20:31:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:31:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:31:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:31:08,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 93 letters. Loop has 2 letters. [2021-12-19 20:31:08,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:31:08,914 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:31:08,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:31:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:31:08,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-19 20:31:08,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:31:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:31:09,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:31:09,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:31:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:31:09,657 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.16 stem predicates 2 loop predicates [2021-12-19 20:31:09,657 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 128 transitions. cyclomatic complexity: 34 Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:31:10,066 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 128 transitions. cyclomatic complexity: 34. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 139 states and 173 transitions. Complement of second has 36 states. [2021-12-19 20:31:10,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 16 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:31:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:31:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 107 transitions. [2021-12-19 20:31:10,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 107 transitions. Stem has 93 letters. Loop has 2 letters. [2021-12-19 20:31:10,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:31:10,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 107 transitions. Stem has 95 letters. Loop has 2 letters. [2021-12-19 20:31:10,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:31:10,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 107 transitions. Stem has 93 letters. Loop has 4 letters. [2021-12-19 20:31:10,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:31:10,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 173 transitions. [2021-12-19 20:31:10,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:31:10,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 134 states and 166 transitions. [2021-12-19 20:31:10,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:31:10,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:31:10,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 166 transitions. [2021-12-19 20:31:10,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:31:10,070 INFO L681 BuchiCegarLoop]: Abstraction has 134 states and 166 transitions. [2021-12-19 20:31:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 166 transitions. [2021-12-19 20:31:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2021-12-19 20:31:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:31:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2021-12-19 20:31:10,073 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 134 transitions. [2021-12-19 20:31:10,073 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 134 transitions. [2021-12-19 20:31:10,073 INFO L425 BuchiCegarLoop]: ======== Iteration 37============ [2021-12-19 20:31:10,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 134 transitions. [2021-12-19 20:31:10,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:31:10,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:31:10,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:31:10,074 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2021-12-19 20:31:10,074 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:31:10,075 INFO L791 eck$LassoCheckResult]: Stem: 40151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 40152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 40153#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 40146#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 40147#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40148#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40149#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40150#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40154#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40191#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40190#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40189#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40188#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40187#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40186#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40185#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40184#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40183#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40182#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40181#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40180#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40179#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40178#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40177#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40176#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40175#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40174#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40173#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40172#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40171#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40170#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40169#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40168#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 40167#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 40166#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 40159#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 40155#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40156#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40260#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40259#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40157#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40158#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40164#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40160#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40161#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40257#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40256#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40255#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40254#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40252#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40251#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40250#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40249#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40247#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40246#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40245#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40244#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40242#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40241#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40240#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40239#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40237#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40236#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40235#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40234#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40232#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40231#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40230#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40229#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40227#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40226#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40225#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40224#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40222#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40221#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40220#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40219#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40217#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40216#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40215#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40214#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40212#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40211#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40210#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40209#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40207#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40206#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40205#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40204#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40202#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40201#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40200#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40199#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40198#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40195#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 40194#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 40192#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 40162#L517-3 [2021-12-19 20:31:10,075 INFO L793 eck$LassoCheckResult]: Loop: 40162#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 40163#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 40162#L517-3 [2021-12-19 20:31:10,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:31:10,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2121708753, now seen corresponding path program 34 times [2021-12-19 20:31:10,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:31:10,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721141952] [2021-12-19 20:31:10,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:31:10,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:31:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:31:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 378 proven. 282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:31:10,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:31:10,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721141952] [2021-12-19 20:31:10,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721141952] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:31:10,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210695762] [2021-12-19 20:31:10,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 20:31:10,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:31:10,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:31:10,491 INFO L229 MonitoredProcess]: Starting monitored process 326 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:31:10,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (326)] Waiting until timeout for monitored process [2021-12-19 20:31:10,660 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 20:31:10,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:31:10,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-19 20:31:10,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:31:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 435 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:31:11,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:31:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 435 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:31:11,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210695762] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:31:11,414 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:31:11,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2021-12-19 20:31:11,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719868031] [2021-12-19 20:31:11,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:31:11,414 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:31:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:31:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 34 times [2021-12-19 20:31:11,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:31:11,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40963204] [2021-12-19 20:31:11,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:31:11,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:31:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:31:11,418 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:31:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:31:11,421 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:31:11,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:31:11,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-19 20:31:11,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=2139, Unknown=0, NotChecked=0, Total=2756 [2021-12-19 20:31:11,458 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. cyclomatic complexity: 36 Second operand has 53 states, 52 states have (on average 3.2115384615384617) internal successors, (167), 53 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:31:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:31:11,895 INFO L93 Difference]: Finished difference Result 196 states and 229 transitions. [2021-12-19 20:31:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-19 20:31:11,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 229 transitions. [2021-12-19 20:31:11,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:31:11,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 119 states and 137 transitions. [2021-12-19 20:31:11,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:31:11,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:31:11,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 137 transitions. [2021-12-19 20:31:11,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:31:11,897 INFO L681 BuchiCegarLoop]: Abstraction has 119 states and 137 transitions. [2021-12-19 20:31:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 137 transitions. [2021-12-19 20:31:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2021-12-19 20:31:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.152542372881356) internal successors, (136), 117 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:31:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2021-12-19 20:31:11,899 INFO L704 BuchiCegarLoop]: Abstraction has 118 states and 136 transitions. [2021-12-19 20:31:11,899 INFO L587 BuchiCegarLoop]: Abstraction has 118 states and 136 transitions. [2021-12-19 20:31:11,899 INFO L425 BuchiCegarLoop]: ======== Iteration 38============ [2021-12-19 20:31:11,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 136 transitions. [2021-12-19 20:31:11,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:31:11,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:31:11,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:31:11,901 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2021-12-19 20:31:11,901 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:31:11,901 INFO L791 eck$LassoCheckResult]: Stem: 41129#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 41130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 41131#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 41124#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 41125#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41126#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41127#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41128#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41132#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41174#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41173#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41172#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41171#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41170#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41169#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41168#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41167#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41166#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41165#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41164#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41163#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41162#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41161#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41160#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41159#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41158#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41157#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41156#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41155#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41154#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41153#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41152#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41151#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41150#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41149#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 41144#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 41143#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 41138#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 41133#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41134#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41141#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41137#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41135#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41136#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41240#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41239#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41238#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41236#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41235#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41234#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41233#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41231#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41230#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41229#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41228#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41226#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41225#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41224#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41223#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41221#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41220#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41219#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41218#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41216#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41215#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41214#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41213#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41211#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41210#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41209#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41208#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41206#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41205#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41204#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41203#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41201#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41200#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41199#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41198#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41196#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41195#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41194#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41193#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41191#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41190#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41189#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41188#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41186#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41185#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41184#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41183#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41181#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41180#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41179#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41178#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41177#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41148#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 41147#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 41145#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 41139#L517-3 [2021-12-19 20:31:11,901 INFO L793 eck$LassoCheckResult]: Loop: 41139#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 41140#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 41139#L517-3 [2021-12-19 20:31:11,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:31:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash 588562829, now seen corresponding path program 35 times [2021-12-19 20:31:11,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:31:11,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801813292] [2021-12-19 20:31:11,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:31:11,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:31:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:31:11,934 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:31:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:31:11,965 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:31:11,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:31:11,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 35 times [2021-12-19 20:31:11,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:31:11,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607218441] [2021-12-19 20:31:11,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:31:11,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:31:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:31:11,971 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:31:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:31:11,975 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:31:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:31:11,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1326803246, now seen corresponding path program 19 times [2021-12-19 20:31:11,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:31:11,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279183892] [2021-12-19 20:31:11,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:31:11,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:31:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:31:12,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:31:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:31:12,035 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:31:49,485 WARN L227 SmtUtils]: Spent 37.41s on a formula simplification. DAG size of input: 582 DAG size of output: 386 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:31:51,748 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:31:51,748 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:31:51,748 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:31:51,748 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:31:51,748 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:31:51,749 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:31:51,749 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:31:51,749 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:31:51,749 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration38_Lasso [2021-12-19 20:31:51,749 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:31:51,749 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:31:51,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:31:51,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:32:14,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:32:14,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:32:14,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:32:14,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:32:14,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:32:14,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:32:14,819 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:32:14,819 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:32:14,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:14,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:14,821 INFO L229 MonitoredProcess]: Starting monitored process 327 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:14,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (327)] Waiting until timeout for monitored process [2021-12-19 20:32:14,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:14,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:14,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:14,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:14,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:14,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:14,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:14,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:14,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (327)] Ended with exit code 0 [2021-12-19 20:32:14,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:14,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:14,851 INFO L229 MonitoredProcess]: Starting monitored process 328 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:14,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (328)] Waiting until timeout for monitored process [2021-12-19 20:32:14,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:14,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:14,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:32:14,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:14,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:14,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:14,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:32:14,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:32:14,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:14,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (328)] Ended with exit code 0 [2021-12-19 20:32:14,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:14,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:14,877 INFO L229 MonitoredProcess]: Starting monitored process 329 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:14,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (329)] Waiting until timeout for monitored process [2021-12-19 20:32:14,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:14,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:14,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:32:14,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:14,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:14,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:14,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:32:14,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:32:14,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:14,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (329)] Ended with exit code 0 [2021-12-19 20:32:14,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:14,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:14,902 INFO L229 MonitoredProcess]: Starting monitored process 330 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:14,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (330)] Waiting until timeout for monitored process [2021-12-19 20:32:14,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:14,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:14,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:32:14,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:14,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:14,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:14,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:32:14,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:32:14,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:14,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (330)] Ended with exit code 0 [2021-12-19 20:32:14,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:14,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:14,928 INFO L229 MonitoredProcess]: Starting monitored process 331 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:14,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (331)] Waiting until timeout for monitored process [2021-12-19 20:32:14,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:14,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:14,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:14,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:14,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:14,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:14,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:14,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:14,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (331)] Ended with exit code 0 [2021-12-19 20:32:14,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:14,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:14,955 INFO L229 MonitoredProcess]: Starting monitored process 332 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:14,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (332)] Waiting until timeout for monitored process [2021-12-19 20:32:14,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:14,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:14,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:14,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:14,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:14,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:14,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:14,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:14,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (332)] Forceful destruction successful, exit code 0 [2021-12-19 20:32:14,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:14,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:14,982 INFO L229 MonitoredProcess]: Starting monitored process 333 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:14,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (333)] Waiting until timeout for monitored process [2021-12-19 20:32:14,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:14,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:14,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:32:14,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:14,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:14,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:14,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:32:14,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:32:14,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (333)] Ended with exit code 0 [2021-12-19 20:32:15,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,009 INFO L229 MonitoredProcess]: Starting monitored process 334 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (334)] Waiting until timeout for monitored process [2021-12-19 20:32:15,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:32:15,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:32:15,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:32:15,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (334)] Ended with exit code 0 [2021-12-19 20:32:15,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,034 INFO L229 MonitoredProcess]: Starting monitored process 335 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (335)] Waiting until timeout for monitored process [2021-12-19 20:32:15,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:32:15,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:32:15,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:32:15,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (335)] Ended with exit code 0 [2021-12-19 20:32:15,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,059 INFO L229 MonitoredProcess]: Starting monitored process 336 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (336)] Waiting until timeout for monitored process [2021-12-19 20:32:15,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:32:15,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:32:15,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:32:15,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (336)] Ended with exit code 0 [2021-12-19 20:32:15,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,096 INFO L229 MonitoredProcess]: Starting monitored process 337 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (337)] Waiting until timeout for monitored process [2021-12-19 20:32:15,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (337)] Forceful destruction successful, exit code 0 [2021-12-19 20:32:15,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,123 INFO L229 MonitoredProcess]: Starting monitored process 338 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (338)] Waiting until timeout for monitored process [2021-12-19 20:32:15,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (338)] Ended with exit code 0 [2021-12-19 20:32:15,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,149 INFO L229 MonitoredProcess]: Starting monitored process 339 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (339)] Waiting until timeout for monitored process [2021-12-19 20:32:15,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (339)] Forceful destruction successful, exit code 0 [2021-12-19 20:32:15,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,177 INFO L229 MonitoredProcess]: Starting monitored process 340 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (340)] Waiting until timeout for monitored process [2021-12-19 20:32:15,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (340)] Ended with exit code 0 [2021-12-19 20:32:15,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,206 INFO L229 MonitoredProcess]: Starting monitored process 341 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (341)] Waiting until timeout for monitored process [2021-12-19 20:32:15,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (341)] Ended with exit code 0 [2021-12-19 20:32:15,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,242 INFO L229 MonitoredProcess]: Starting monitored process 342 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (342)] Waiting until timeout for monitored process [2021-12-19 20:32:15,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (342)] Ended with exit code 0 [2021-12-19 20:32:15,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,274 INFO L229 MonitoredProcess]: Starting monitored process 343 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (343)] Waiting until timeout for monitored process [2021-12-19 20:32:15,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (343)] Ended with exit code 0 [2021-12-19 20:32:15,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,304 INFO L229 MonitoredProcess]: Starting monitored process 344 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (344)] Waiting until timeout for monitored process [2021-12-19 20:32:15,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (344)] Ended with exit code 0 [2021-12-19 20:32:15,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,334 INFO L229 MonitoredProcess]: Starting monitored process 345 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (345)] Waiting until timeout for monitored process [2021-12-19 20:32:15,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (345)] Ended with exit code 0 [2021-12-19 20:32:15,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,363 INFO L229 MonitoredProcess]: Starting monitored process 346 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (346)] Waiting until timeout for monitored process [2021-12-19 20:32:15,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (346)] Forceful destruction successful, exit code 0 [2021-12-19 20:32:15,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,392 INFO L229 MonitoredProcess]: Starting monitored process 347 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (347)] Waiting until timeout for monitored process [2021-12-19 20:32:15,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (347)] Ended with exit code 0 [2021-12-19 20:32:15,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,419 INFO L229 MonitoredProcess]: Starting monitored process 348 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (348)] Waiting until timeout for monitored process [2021-12-19 20:32:15,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (348)] Ended with exit code 0 [2021-12-19 20:32:15,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,448 INFO L229 MonitoredProcess]: Starting monitored process 349 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (349)] Waiting until timeout for monitored process [2021-12-19 20:32:15,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (349)] Ended with exit code 0 [2021-12-19 20:32:15,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,477 INFO L229 MonitoredProcess]: Starting monitored process 350 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (350)] Waiting until timeout for monitored process [2021-12-19 20:32:15,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (350)] Ended with exit code 0 [2021-12-19 20:32:15,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,506 INFO L229 MonitoredProcess]: Starting monitored process 351 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (351)] Waiting until timeout for monitored process [2021-12-19 20:32:15,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (351)] Forceful destruction successful, exit code 0 [2021-12-19 20:32:15,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,535 INFO L229 MonitoredProcess]: Starting monitored process 352 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (352)] Waiting until timeout for monitored process [2021-12-19 20:32:15,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (352)] Forceful destruction successful, exit code 0 [2021-12-19 20:32:15,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,564 INFO L229 MonitoredProcess]: Starting monitored process 353 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (353)] Waiting until timeout for monitored process [2021-12-19 20:32:15,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:32:15,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (353)] Ended with exit code 0 [2021-12-19 20:32:15,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,593 INFO L229 MonitoredProcess]: Starting monitored process 354 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (354)] Waiting until timeout for monitored process [2021-12-19 20:32:15,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:32:15,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:32:15,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:32:15,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:32:15,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:32:15,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:32:15,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:32:15,607 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:32:15,614 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-12-19 20:32:15,614 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:32:15,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:32:15,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:15,615 INFO L229 MonitoredProcess]: Starting monitored process 355 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:32:15,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (355)] Waiting until timeout for monitored process [2021-12-19 20:32:15,617 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:32:15,623 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:32:15,623 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:32:15,623 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 60))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 60))_1 Supporting invariants [] [2021-12-19 20:32:15,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (354)] Ended with exit code 0 [2021-12-19 20:32:15,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (355)] Forceful destruction successful, exit code 0 [2021-12-19 20:32:18,096 INFO L297 tatePredicateManager]: 499 out of 501 supporting invariants were superfluous and have been removed [2021-12-19 20:32:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:32:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:32:18,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-19 20:32:18,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:32:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:32:18,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:32:18,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:32:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:32:18,903 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.17 stem predicates 2 loop predicates [2021-12-19 20:32:18,903 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 136 transitions. cyclomatic complexity: 36 Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:32:18,943 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 136 transitions. cyclomatic complexity: 36. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 119 states and 138 transitions. Complement of second has 4 states. [2021-12-19 20:32:18,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:32:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:32:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:32:18,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 99 letters. Loop has 2 letters. [2021-12-19 20:32:18,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:32:18,944 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:32:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:32:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:32:19,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-19 20:32:19,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:32:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:32:19,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:32:19,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:32:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:32:19,783 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.17 stem predicates 2 loop predicates [2021-12-19 20:32:19,784 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 136 transitions. cyclomatic complexity: 36 Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:32:19,824 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 136 transitions. cyclomatic complexity: 36. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 119 states and 138 transitions. Complement of second has 4 states. [2021-12-19 20:32:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:32:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:32:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:32:19,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 99 letters. Loop has 2 letters. [2021-12-19 20:32:19,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:32:19,825 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:32:19,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:32:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:32:19,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-19 20:32:19,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:32:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:32:20,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:32:20,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:32:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:32:20,643 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.17 stem predicates 2 loop predicates [2021-12-19 20:32:20,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 136 transitions. cyclomatic complexity: 36 Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:32:21,110 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 136 transitions. cyclomatic complexity: 36. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 147 states and 183 transitions. Complement of second has 38 states. [2021-12-19 20:32:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 17 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:32:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 19 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:32:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 113 transitions. [2021-12-19 20:32:21,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 113 transitions. Stem has 99 letters. Loop has 2 letters. [2021-12-19 20:32:21,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:32:21,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 113 transitions. Stem has 101 letters. Loop has 2 letters. [2021-12-19 20:32:21,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:32:21,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 113 transitions. Stem has 99 letters. Loop has 4 letters. [2021-12-19 20:32:21,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:32:21,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 183 transitions. [2021-12-19 20:32:21,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:32:21,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 142 states and 176 transitions. [2021-12-19 20:32:21,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:32:21,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:32:21,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 176 transitions. [2021-12-19 20:32:21,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:32:21,116 INFO L681 BuchiCegarLoop]: Abstraction has 142 states and 176 transitions. [2021-12-19 20:32:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 176 transitions. [2021-12-19 20:32:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 123. [2021-12-19 20:32:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.1544715447154472) internal successors, (142), 122 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:32:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2021-12-19 20:32:21,118 INFO L704 BuchiCegarLoop]: Abstraction has 123 states and 142 transitions. [2021-12-19 20:32:21,118 INFO L587 BuchiCegarLoop]: Abstraction has 123 states and 142 transitions. [2021-12-19 20:32:21,118 INFO L425 BuchiCegarLoop]: ======== Iteration 39============ [2021-12-19 20:32:21,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 142 transitions. [2021-12-19 20:32:21,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:32:21,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:32:21,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:32:21,119 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2021-12-19 20:32:21,120 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:32:21,120 INFO L791 eck$LassoCheckResult]: Stem: 44687#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 44688#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 44689#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 44682#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 44683#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44684#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44685#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44686#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44690#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44729#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44728#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44727#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44726#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44725#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44724#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44723#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44722#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44721#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44720#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44719#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44718#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44717#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44716#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44715#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44714#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44713#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44712#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44711#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44710#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44709#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44708#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44707#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44706#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44705#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44704#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 44703#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 44702#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 44697#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 44691#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44692#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44803#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44802#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44693#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44694#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44700#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44695#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44696#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44800#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44799#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44798#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44797#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44795#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44794#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44793#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44792#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44790#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44789#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44788#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44787#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44785#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44784#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44783#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44782#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44780#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44779#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44778#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44777#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44775#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44774#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44773#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44772#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44770#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44769#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44768#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44767#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44765#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44764#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44763#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44762#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44760#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44759#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44758#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44757#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44755#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44754#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44753#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44752#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44750#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44749#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44748#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44747#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44745#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44744#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44743#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44742#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44740#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44739#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44738#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44737#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44736#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44733#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 44732#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44730#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 44698#L517-3 [2021-12-19 20:32:21,120 INFO L793 eck$LassoCheckResult]: Loop: 44698#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 44699#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 44698#L517-3 [2021-12-19 20:32:21,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:32:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash 547367010, now seen corresponding path program 36 times [2021-12-19 20:32:21,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:32:21,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530745062] [2021-12-19 20:32:21,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:32:21,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:32:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:32:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 435 proven. 317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:32:21,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:32:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530745062] [2021-12-19 20:32:21,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530745062] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:32:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876341483] [2021-12-19 20:32:21,605 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-19 20:32:21,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:32:21,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:32:21,608 INFO L229 MonitoredProcess]: Starting monitored process 356 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:32:21,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (356)] Waiting until timeout for monitored process [2021-12-19 20:32:22,918 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2021-12-19 20:32:22,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:32:22,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-19 20:32:22,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:32:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 496 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:32:23,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:32:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 496 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:32:23,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876341483] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:32:23,760 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:32:23,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 55 [2021-12-19 20:32:23,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149474837] [2021-12-19 20:32:23,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:32:23,761 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:32:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:32:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 36 times [2021-12-19 20:32:23,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:32:23,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948523428] [2021-12-19 20:32:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:32:23,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:32:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:32:23,766 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:32:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:32:23,769 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:32:23,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:32:23,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-19 20:32:23,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=689, Invalid=2391, Unknown=0, NotChecked=0, Total=3080 [2021-12-19 20:32:23,800 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. cyclomatic complexity: 38 Second operand has 56 states, 55 states have (on average 3.2181818181818183) internal successors, (177), 56 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:32:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:32:24,335 INFO L93 Difference]: Finished difference Result 208 states and 243 transitions. [2021-12-19 20:32:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-19 20:32:24,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 208 states and 243 transitions. [2021-12-19 20:32:24,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:32:24,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 208 states to 126 states and 145 transitions. [2021-12-19 20:32:24,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:32:24,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:32:24,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 145 transitions. [2021-12-19 20:32:24,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:32:24,337 INFO L681 BuchiCegarLoop]: Abstraction has 126 states and 145 transitions. [2021-12-19 20:32:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 145 transitions. [2021-12-19 20:32:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2021-12-19 20:32:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.152) internal successors, (144), 124 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:32:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2021-12-19 20:32:24,339 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 144 transitions. [2021-12-19 20:32:24,339 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 144 transitions. [2021-12-19 20:32:24,339 INFO L425 BuchiCegarLoop]: ======== Iteration 40============ [2021-12-19 20:32:24,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 144 transitions. [2021-12-19 20:32:24,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:32:24,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:32:24,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:32:24,340 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2021-12-19 20:32:24,340 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:32:24,340 INFO L791 eck$LassoCheckResult]: Stem: 45725#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 45726#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 45727#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 45720#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 45721#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45722#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45723#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45724#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45728#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45772#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45771#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45770#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45769#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45768#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45767#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45766#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45765#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45764#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45763#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45762#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45761#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45760#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45759#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45758#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45757#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45756#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45755#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45754#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45753#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45752#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45751#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45750#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45749#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45748#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45747#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45746#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45745#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 45740#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 45739#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 45734#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 45729#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45730#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45737#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45733#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45731#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45732#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45843#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45842#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45841#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45839#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45838#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45837#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45836#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45834#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45833#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45832#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45831#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45829#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45828#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45827#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45826#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45824#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45823#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45822#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45821#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45819#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45818#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45817#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45816#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45814#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45813#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45812#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45811#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45809#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45808#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45807#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45806#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45804#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45803#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45802#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45801#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45799#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45798#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45797#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45796#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45794#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45793#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45792#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45791#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45789#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45788#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45787#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45786#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45784#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45783#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45782#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45781#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45779#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45778#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45777#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45776#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45775#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45744#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 45743#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 45741#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 45735#L517-3 [2021-12-19 20:32:24,341 INFO L793 eck$LassoCheckResult]: Loop: 45735#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45736#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 45735#L517-3 [2021-12-19 20:32:24,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:32:24,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1178279872, now seen corresponding path program 37 times [2021-12-19 20:32:24,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:32:24,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197747005] [2021-12-19 20:32:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:32:24,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:32:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:32:24,374 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:32:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:32:24,407 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:32:24,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:32:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 37 times [2021-12-19 20:32:24,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:32:24,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011165193] [2021-12-19 20:32:24,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:32:24,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:32:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:32:24,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:32:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:32:24,415 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:32:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:32:24,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1544410309, now seen corresponding path program 20 times [2021-12-19 20:32:24,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:32:24,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897719336] [2021-12-19 20:32:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:32:24,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:32:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:32:24,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:32:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:32:24,480 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:33:26,051 WARN L227 SmtUtils]: Spent 1.03m on a formula simplification. DAG size of input: 615 DAG size of output: 407 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:33:32,499 WARN L227 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 196 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:33:32,501 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:33:32,501 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:33:32,501 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:33:32,502 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:33:32,502 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:33:32,502 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:32,502 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:33:32,502 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:33:32,502 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration40_Lasso [2021-12-19 20:33:32,502 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:33:32,502 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:33:32,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:32,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:32,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:32,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:32,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:32,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:32,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:32,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:32,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:32,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:32,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:32,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:43,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:43,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:43,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:43,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:43,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:43,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:33:44,540 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:33:44,540 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:33:44,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,541 INFO L229 MonitoredProcess]: Starting monitored process 357 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (357)] Waiting until timeout for monitored process [2021-12-19 20:33:44,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:33:44,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:33:44,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:33:44,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (357)] Ended with exit code 0 [2021-12-19 20:33:44,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,568 INFO L229 MonitoredProcess]: Starting monitored process 358 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (358)] Waiting until timeout for monitored process [2021-12-19 20:33:44,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:33:44,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:33:44,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:33:44,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (358)] Forceful destruction successful, exit code 0 [2021-12-19 20:33:44,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,593 INFO L229 MonitoredProcess]: Starting monitored process 359 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (359)] Waiting until timeout for monitored process [2021-12-19 20:33:44,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:33:44,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:33:44,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:33:44,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (359)] Ended with exit code 0 [2021-12-19 20:33:44,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,618 INFO L229 MonitoredProcess]: Starting monitored process 360 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (360)] Waiting until timeout for monitored process [2021-12-19 20:33:44,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:33:44,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:33:44,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (360)] Forceful destruction successful, exit code 0 [2021-12-19 20:33:44,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,645 INFO L229 MonitoredProcess]: Starting monitored process 361 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (361)] Waiting until timeout for monitored process [2021-12-19 20:33:44,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:33:44,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:33:44,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:33:44,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (361)] Ended with exit code 0 [2021-12-19 20:33:44,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,670 INFO L229 MonitoredProcess]: Starting monitored process 362 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (362)] Waiting until timeout for monitored process [2021-12-19 20:33:44,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:33:44,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:33:44,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:33:44,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (362)] Forceful destruction successful, exit code 0 [2021-12-19 20:33:44,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,694 INFO L229 MonitoredProcess]: Starting monitored process 363 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (363)] Waiting until timeout for monitored process [2021-12-19 20:33:44,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:33:44,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:33:44,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (363)] Forceful destruction successful, exit code 0 [2021-12-19 20:33:44,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,721 INFO L229 MonitoredProcess]: Starting monitored process 364 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (364)] Waiting until timeout for monitored process [2021-12-19 20:33:44,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:33:44,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:33:44,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (364)] Ended with exit code 0 [2021-12-19 20:33:44,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,748 INFO L229 MonitoredProcess]: Starting monitored process 365 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (365)] Waiting until timeout for monitored process [2021-12-19 20:33:44,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:33:44,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:33:44,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:33:44,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (365)] Ended with exit code 0 [2021-12-19 20:33:44,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,773 INFO L229 MonitoredProcess]: Starting monitored process 366 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (366)] Waiting until timeout for monitored process [2021-12-19 20:33:44,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:33:44,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:33:44,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:33:44,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (366)] Ended with exit code 0 [2021-12-19 20:33:44,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,798 INFO L229 MonitoredProcess]: Starting monitored process 367 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (367)] Waiting until timeout for monitored process [2021-12-19 20:33:44,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:33:44,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:33:44,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:33:44,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (367)] Ended with exit code 0 [2021-12-19 20:33:44,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,823 INFO L229 MonitoredProcess]: Starting monitored process 368 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (368)] Waiting until timeout for monitored process [2021-12-19 20:33:44,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:33:44,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:33:44,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (368)] Ended with exit code 0 [2021-12-19 20:33:44,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,852 INFO L229 MonitoredProcess]: Starting monitored process 369 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (369)] Waiting until timeout for monitored process [2021-12-19 20:33:44,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:33:44,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:33:44,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (369)] Ended with exit code 0 [2021-12-19 20:33:44,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,882 INFO L229 MonitoredProcess]: Starting monitored process 370 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (370)] Waiting until timeout for monitored process [2021-12-19 20:33:44,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:33:44,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:33:44,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (370)] Ended with exit code 0 [2021-12-19 20:33:44,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,910 INFO L229 MonitoredProcess]: Starting monitored process 371 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (371)] Waiting until timeout for monitored process [2021-12-19 20:33:44,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:33:44,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:33:44,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:33:44,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (371)] Ended with exit code 0 [2021-12-19 20:33:44,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,940 INFO L229 MonitoredProcess]: Starting monitored process 372 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (372)] Waiting until timeout for monitored process [2021-12-19 20:33:44,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:33:44,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:33:44,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:33:44,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:33:44,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:33:44,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:33:44,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:33:44,955 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:33:44,960 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-19 20:33:44,960 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-19 20:33:44,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:33:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:33:44,962 INFO L229 MonitoredProcess]: Starting monitored process 373 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:33:44,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (373)] Waiting until timeout for monitored process [2021-12-19 20:33:44,963 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:33:44,969 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:33:44,969 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:33:44,969 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* ULTIMATE.start_main_~k~0#1 4) ULTIMATE.start_main_~numbers~0#1.offset (- 4)))_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* ULTIMATE.start_main_~k~0#1 4) ULTIMATE.start_main_~numbers~0#1.offset (- 4)))_4 Supporting invariants [] [2021-12-19 20:33:44,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (372)] Ended with exit code 0 [2021-12-19 20:33:45,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (373)] Forceful destruction successful, exit code 0 [2021-12-19 20:33:48,368 INFO L297 tatePredicateManager]: 564 out of 566 supporting invariants were superfluous and have been removed [2021-12-19 20:33:48,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:33:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:33:48,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-19 20:33:48,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:33:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:33:49,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:33:49,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:33:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:33:49,886 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.36 stem predicates 2 loop predicates [2021-12-19 20:33:49,886 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 144 transitions. cyclomatic complexity: 38 Second operand has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:33:50,369 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 144 transitions. cyclomatic complexity: 38. Second operand has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 131 states and 152 transitions. Complement of second has 22 states. [2021-12-19 20:33:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 20 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:33:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:33:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 48 transitions. [2021-12-19 20:33:50,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 48 transitions. Stem has 105 letters. Loop has 2 letters. [2021-12-19 20:33:50,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:33:50,370 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:33:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:33:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:33:50,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-19 20:33:50,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:33:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:33:51,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:33:51,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:33:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:33:51,955 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.36 stem predicates 2 loop predicates [2021-12-19 20:33:51,955 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 144 transitions. cyclomatic complexity: 38 Second operand has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:33:52,502 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 144 transitions. cyclomatic complexity: 38. Second operand has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 131 states and 152 transitions. Complement of second has 22 states. [2021-12-19 20:33:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 20 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:33:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:33:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 48 transitions. [2021-12-19 20:33:52,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 48 transitions. Stem has 105 letters. Loop has 2 letters. [2021-12-19 20:33:52,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:33:52,503 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:33:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:33:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:33:52,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-19 20:33:52,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:33:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:33:53,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:33:53,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:33:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:33:54,018 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.36 stem predicates 2 loop predicates [2021-12-19 20:33:54,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 144 transitions. cyclomatic complexity: 38 Second operand has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:33:55,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 144 transitions. cyclomatic complexity: 38. Second operand has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 263 states and 336 transitions. Complement of second has 59 states. [2021-12-19 20:33:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 40 states 36 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:33:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:33:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 163 transitions. [2021-12-19 20:33:55,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 163 transitions. Stem has 105 letters. Loop has 2 letters. [2021-12-19 20:33:55,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:33:55,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 163 transitions. Stem has 107 letters. Loop has 2 letters. [2021-12-19 20:33:55,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:33:55,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 163 transitions. Stem has 105 letters. Loop has 4 letters. [2021-12-19 20:33:55,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:33:55,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 336 transitions. [2021-12-19 20:33:55,466 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-19 20:33:55,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 258 states and 329 transitions. [2021-12-19 20:33:55,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-19 20:33:55,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-19 20:33:55,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 329 transitions. [2021-12-19 20:33:55,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:33:55,468 INFO L681 BuchiCegarLoop]: Abstraction has 258 states and 329 transitions. [2021-12-19 20:33:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 329 transitions. [2021-12-19 20:33:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 134. [2021-12-19 20:33:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.1567164179104477) internal successors, (155), 133 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:33:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2021-12-19 20:33:55,470 INFO L704 BuchiCegarLoop]: Abstraction has 134 states and 155 transitions. [2021-12-19 20:33:55,470 INFO L587 BuchiCegarLoop]: Abstraction has 134 states and 155 transitions. [2021-12-19 20:33:55,471 INFO L425 BuchiCegarLoop]: ======== Iteration 41============ [2021-12-19 20:33:55,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 155 transitions. [2021-12-19 20:33:55,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:33:55,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:33:55,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:33:55,472 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [18, 18, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2021-12-19 20:33:55,472 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:33:55,472 INFO L791 eck$LassoCheckResult]: Stem: 49913#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 49914#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 49915#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 49908#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 49909#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49910#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49911#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49912#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49916#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49957#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49956#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49955#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49954#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49953#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49952#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49951#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49950#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49949#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49948#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49947#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49946#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49945#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49944#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49943#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49942#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49941#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49940#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49939#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49938#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49937#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49936#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49935#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49934#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49933#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49932#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49931#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49929#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49930#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 50041#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 49928#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 49927#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 49922#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 49917#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 49918#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 49926#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 49920#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 49921#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 50033#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 50032#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 50031#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 50030#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 50028#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 50027#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 50026#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 50025#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 50023#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 50022#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 50021#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 50020#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 50018#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 50017#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 50016#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 50015#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 50013#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 50012#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 50011#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 50010#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 50008#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 50007#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 50006#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 50005#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 50003#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 50002#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 50001#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 50000#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 49998#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 49997#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 49996#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 49995#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 49993#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 49992#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 49991#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 49990#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 49988#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 49987#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 49986#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 49985#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 49983#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 49982#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 49981#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 49980#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 49978#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 49977#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 49976#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 49975#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 49973#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 49972#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 49971#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 49970#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 49968#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 49967#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 49966#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 49965#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 49964#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 49961#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 49960#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 49958#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 49924#L517-3 [2021-12-19 20:33:55,472 INFO L793 eck$LassoCheckResult]: Loop: 49924#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 49923#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 49924#L517-3 [2021-12-19 20:33:55,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:33:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1667557218, now seen corresponding path program 38 times [2021-12-19 20:33:55,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:33:55,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422672388] [2021-12-19 20:33:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:33:55,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:33:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:33:55,510 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:33:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:33:55,542 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:33:55,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:33:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 38 times [2021-12-19 20:33:55,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:33:55,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485810936] [2021-12-19 20:33:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:33:55,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:33:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:33:55,548 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:33:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:33:55,551 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:33:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:33:55,551 INFO L85 PathProgramCache]: Analyzing trace with hash -499683933, now seen corresponding path program 21 times [2021-12-19 20:33:55,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:33:55,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946059985] [2021-12-19 20:33:55,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:33:55,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:33:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:33:55,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:33:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:33:55,618 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:35:11,714 WARN L227 SmtUtils]: Spent 1.27m on a formula simplification. DAG size of input: 632 DAG size of output: 418 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:35:14,929 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:35:14,929 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:35:14,929 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:35:14,929 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:35:14,929 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:35:14,929 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:14,929 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:35:14,929 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:35:14,929 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration41_Lasso [2021-12-19 20:35:14,929 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:35:14,929 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:35:14,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:14,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:14,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:14,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:14,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:14,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:14,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:14,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:35:21,763 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:35:21,763 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:35:21,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:21,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:21,765 INFO L229 MonitoredProcess]: Starting monitored process 374 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:21,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (374)] Waiting until timeout for monitored process [2021-12-19 20:35:21,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:21,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:21,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:35:21,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:21,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:21,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:21,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:35:21,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:35:21,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:21,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (374)] Ended with exit code 0 [2021-12-19 20:35:21,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:21,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:21,790 INFO L229 MonitoredProcess]: Starting monitored process 375 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:21,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (375)] Waiting until timeout for monitored process [2021-12-19 20:35:21,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:21,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:21,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:35:21,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:21,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:21,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:21,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:35:21,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:35:21,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:21,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (375)] Ended with exit code 0 [2021-12-19 20:35:21,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:21,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:21,813 INFO L229 MonitoredProcess]: Starting monitored process 376 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:21,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (376)] Waiting until timeout for monitored process [2021-12-19 20:35:21,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:21,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:21,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:35:21,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:21,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:21,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:21,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:35:21,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:35:21,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:21,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (376)] Ended with exit code 0 [2021-12-19 20:35:21,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:21,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:21,836 INFO L229 MonitoredProcess]: Starting monitored process 377 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:21,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (377)] Waiting until timeout for monitored process [2021-12-19 20:35:21,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:21,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:21,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:35:21,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:21,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:21,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:21,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:35:21,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:35:21,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:21,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (377)] Forceful destruction successful, exit code 0 [2021-12-19 20:35:21,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:21,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:21,858 INFO L229 MonitoredProcess]: Starting monitored process 378 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:21,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (378)] Waiting until timeout for monitored process [2021-12-19 20:35:21,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:21,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:21,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:35:21,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:21,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:21,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:21,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:35:21,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:35:21,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:21,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (378)] Ended with exit code 0 [2021-12-19 20:35:21,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:21,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:21,881 INFO L229 MonitoredProcess]: Starting monitored process 379 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:21,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (379)] Waiting until timeout for monitored process [2021-12-19 20:35:21,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:21,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:21,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:35:21,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:21,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:21,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:21,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:35:21,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:35:21,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:21,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (379)] Ended with exit code 0 [2021-12-19 20:35:21,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:21,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:21,904 INFO L229 MonitoredProcess]: Starting monitored process 380 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:21,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (380)] Waiting until timeout for monitored process [2021-12-19 20:35:21,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:21,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:21,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:35:21,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:21,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:21,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:21,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:35:21,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:35:21,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:21,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (380)] Forceful destruction successful, exit code 0 [2021-12-19 20:35:21,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:21,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:21,927 INFO L229 MonitoredProcess]: Starting monitored process 381 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:21,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (381)] Waiting until timeout for monitored process [2021-12-19 20:35:21,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:21,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:21,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:21,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:21,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:21,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:35:21,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:35:21,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:21,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (381)] Ended with exit code 0 [2021-12-19 20:35:21,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:21,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:21,952 INFO L229 MonitoredProcess]: Starting monitored process 382 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:21,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (382)] Waiting until timeout for monitored process [2021-12-19 20:35:21,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:21,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:21,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:21,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:21,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:21,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:35:21,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:35:21,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:21,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (382)] Ended with exit code 0 [2021-12-19 20:35:21,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:21,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:21,979 INFO L229 MonitoredProcess]: Starting monitored process 383 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:21,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (383)] Waiting until timeout for monitored process [2021-12-19 20:35:21,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:21,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:21,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:21,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:21,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:21,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:35:21,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:35:21,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:22,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (383)] Ended with exit code 0 [2021-12-19 20:35:22,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:22,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:22,007 INFO L229 MonitoredProcess]: Starting monitored process 384 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:22,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (384)] Waiting until timeout for monitored process [2021-12-19 20:35:22,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:22,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:22,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:22,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:22,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:22,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:35:22,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:35:22,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:22,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (384)] Ended with exit code 0 [2021-12-19 20:35:22,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:22,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:22,042 INFO L229 MonitoredProcess]: Starting monitored process 385 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:22,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (385)] Waiting until timeout for monitored process [2021-12-19 20:35:22,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:22,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:22,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:22,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:22,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:22,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:35:22,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:35:22,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:22,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (385)] Forceful destruction successful, exit code 0 [2021-12-19 20:35:22,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:22,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:22,069 INFO L229 MonitoredProcess]: Starting monitored process 386 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:22,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (386)] Waiting until timeout for monitored process [2021-12-19 20:35:22,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:22,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:22,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:22,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:22,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:22,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:35:22,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:35:22,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:22,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (386)] Ended with exit code 0 [2021-12-19 20:35:22,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:22,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:22,096 INFO L229 MonitoredProcess]: Starting monitored process 387 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:22,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (387)] Waiting until timeout for monitored process [2021-12-19 20:35:22,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:22,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:22,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:22,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:22,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:22,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:35:22,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:35:22,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:22,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (387)] Ended with exit code 0 [2021-12-19 20:35:22,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:22,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:22,123 INFO L229 MonitoredProcess]: Starting monitored process 388 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:22,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (388)] Waiting until timeout for monitored process [2021-12-19 20:35:22,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:22,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:22,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:22,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:22,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:22,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:35:22,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:35:22,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:22,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (388)] Forceful destruction successful, exit code 0 [2021-12-19 20:35:22,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:22,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:22,156 INFO L229 MonitoredProcess]: Starting monitored process 389 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:22,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (389)] Waiting until timeout for monitored process [2021-12-19 20:35:22,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:22,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:22,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:22,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:22,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:22,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:35:22,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:35:22,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:22,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (389)] Ended with exit code 0 [2021-12-19 20:35:22,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:22,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:22,192 INFO L229 MonitoredProcess]: Starting monitored process 390 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:22,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (390)] Waiting until timeout for monitored process [2021-12-19 20:35:22,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:22,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:22,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:22,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:22,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:22,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:35:22,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:35:22,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:35:22,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (390)] Ended with exit code 0 [2021-12-19 20:35:22,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:22,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:22,219 INFO L229 MonitoredProcess]: Starting monitored process 391 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:22,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (391)] Waiting until timeout for monitored process [2021-12-19 20:35:22,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:35:22,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:35:22,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:35:22,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:35:22,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:35:22,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:35:22,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:35:22,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:35:22,237 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-19 20:35:22,237 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:35:22,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:35:22,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:35:22,238 INFO L229 MonitoredProcess]: Starting monitored process 392 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:35:22,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (392)] Waiting until timeout for monitored process [2021-12-19 20:35:22,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:35:22,245 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:35:22,245 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:35:22,245 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* ULTIMATE.start_main_~k~0#1 4) ULTIMATE.start_main_~numbers~0#1.offset (- 8)))_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ (* ULTIMATE.start_main_~k~0#1 4) ULTIMATE.start_main_~numbers~0#1.offset (- 8)))_4 Supporting invariants [] [2021-12-19 20:35:22,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (391)] Forceful destruction successful, exit code 0 [2021-12-19 20:35:22,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (392)] Forceful destruction successful, exit code 0 [2021-12-19 20:35:25,912 INFO L297 tatePredicateManager]: 598 out of 600 supporting invariants were superfluous and have been removed [2021-12-19 20:35:25,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:35:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:35:25,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-19 20:35:25,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:35:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:35:27,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:35:27,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:35:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:35:27,478 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.37 stem predicates 2 loop predicates [2021-12-19 20:35:27,479 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 134 states and 155 transitions. cyclomatic complexity: 41 Second operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:35:28,053 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 134 states and 155 transitions. cyclomatic complexity: 41. Second operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 141 states and 165 transitions. Complement of second has 23 states. [2021-12-19 20:35:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 21 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:35:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:35:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 53 transitions. [2021-12-19 20:35:28,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 53 transitions. Stem has 107 letters. Loop has 2 letters. [2021-12-19 20:35:28,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:35:28,055 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:35:28,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:35:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:35:28,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-19 20:35:28,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:35:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:35:29,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:35:29,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:35:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:35:29,614 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.37 stem predicates 2 loop predicates [2021-12-19 20:35:29,615 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 134 states and 155 transitions. cyclomatic complexity: 41 Second operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:35:29,981 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 134 states and 155 transitions. cyclomatic complexity: 41. Second operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 141 states and 165 transitions. Complement of second has 23 states. [2021-12-19 20:35:29,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 21 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:35:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:35:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 53 transitions. [2021-12-19 20:35:29,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 53 transitions. Stem has 107 letters. Loop has 2 letters. [2021-12-19 20:35:29,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:35:29,982 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:35:30,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:35:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:35:30,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-19 20:35:30,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:35:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:35:31,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:35:31,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:35:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:35:31,529 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.37 stem predicates 2 loop predicates [2021-12-19 20:35:31,529 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 134 states and 155 transitions. cyclomatic complexity: 41 Second operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:35:33,077 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 134 states and 155 transitions. cyclomatic complexity: 41. Second operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 376 states and 486 transitions. Complement of second has 61 states. [2021-12-19 20:35:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 41 states 37 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:35:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 39 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:35:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 173 transitions. [2021-12-19 20:35:33,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 173 transitions. Stem has 107 letters. Loop has 2 letters. [2021-12-19 20:35:33,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:35:33,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 173 transitions. Stem has 109 letters. Loop has 2 letters. [2021-12-19 20:35:33,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:35:33,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 173 transitions. Stem has 107 letters. Loop has 4 letters. [2021-12-19 20:35:33,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:35:33,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 376 states and 486 transitions. [2021-12-19 20:35:33,082 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-12-19 20:35:33,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 376 states to 371 states and 479 transitions. [2021-12-19 20:35:33,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-19 20:35:33,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-19 20:35:33,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 479 transitions. [2021-12-19 20:35:33,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:35:33,084 INFO L681 BuchiCegarLoop]: Abstraction has 371 states and 479 transitions. [2021-12-19 20:35:33,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 479 transitions. [2021-12-19 20:35:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 136. [2021-12-19 20:35:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.161764705882353) internal successors, (158), 135 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:35:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 158 transitions. [2021-12-19 20:35:33,086 INFO L704 BuchiCegarLoop]: Abstraction has 136 states and 158 transitions. [2021-12-19 20:35:33,086 INFO L587 BuchiCegarLoop]: Abstraction has 136 states and 158 transitions. [2021-12-19 20:35:33,087 INFO L425 BuchiCegarLoop]: ======== Iteration 42============ [2021-12-19 20:35:33,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 158 transitions. [2021-12-19 20:35:33,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:35:33,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:35:33,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:35:33,088 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [19, 19, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2021-12-19 20:35:33,088 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:35:33,088 INFO L791 eck$LassoCheckResult]: Stem: 54407#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 54408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 54409#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 54402#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 54403#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54404#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54405#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54406#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54410#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54453#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54452#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54451#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54450#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54449#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54448#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54447#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54446#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54445#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54444#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54443#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54442#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54441#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54440#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54439#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54438#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54437#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54436#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54435#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54434#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54433#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54432#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54431#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54430#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54429#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54428#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54427#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54426#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54424#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54425#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54537#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54422#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 54423#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 54536#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 54535#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 54411#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54412#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54420#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54414#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54415#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54529#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54528#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54527#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54526#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54524#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54523#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54522#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54521#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54519#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54518#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54517#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54516#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54514#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54513#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54512#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54511#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54509#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54508#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54507#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54506#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54504#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54503#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54502#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54501#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54499#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54498#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54497#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54496#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54494#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54493#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54492#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54491#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54489#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54488#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54487#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54486#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54484#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54483#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54482#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54481#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54479#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54478#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54477#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54476#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54474#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54473#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54472#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54471#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54469#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54468#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54467#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54466#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54464#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54463#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54462#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54461#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54460#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54457#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 54456#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 54454#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 54418#L517-3 [2021-12-19 20:35:33,088 INFO L793 eck$LassoCheckResult]: Loop: 54418#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 54419#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 54418#L517-3 [2021-12-19 20:35:33,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:35:33,089 INFO L85 PathProgramCache]: Analyzing trace with hash 583315836, now seen corresponding path program 39 times [2021-12-19 20:35:33,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:35:33,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694982024] [2021-12-19 20:35:33,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:35:33,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:35:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:35:33,122 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:35:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:35:33,156 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:35:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:35:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 39 times [2021-12-19 20:35:33,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:35:33,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309435913] [2021-12-19 20:35:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:35:33,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:35:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:35:33,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:35:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:35:33,164 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:35:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:35:33,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2074196223, now seen corresponding path program 22 times [2021-12-19 20:35:33,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:35:33,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823391401] [2021-12-19 20:35:33,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:35:33,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:35:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:35:33,199 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:35:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:35:33,234 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:37:04,593 WARN L227 SmtUtils]: Spent 1.52m on a formula simplification. DAG size of input: 649 DAG size of output: 429 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:37:09,191 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:37:09,191 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:37:09,191 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:37:09,191 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:37:09,191 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:37:09,191 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:09,191 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:37:09,191 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:37:09,191 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration42_Lasso [2021-12-19 20:37:09,192 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:37:09,192 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:37:09,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:09,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:09,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:09,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:09,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:09,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:09,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:48,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:37:49,290 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:37:49,291 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:37:49,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,303 INFO L229 MonitoredProcess]: Starting monitored process 393 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:37:49,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:37:49,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:37:49,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (393)] Waiting until timeout for monitored process [2021-12-19 20:37:49,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (393)] Forceful destruction successful, exit code 0 [2021-12-19 20:37:49,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,352 INFO L229 MonitoredProcess]: Starting monitored process 394 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (394)] Waiting until timeout for monitored process [2021-12-19 20:37:49,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (394)] Forceful destruction successful, exit code 0 [2021-12-19 20:37:49,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,397 INFO L229 MonitoredProcess]: Starting monitored process 395 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (395)] Waiting until timeout for monitored process [2021-12-19 20:37:49,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (395)] Forceful destruction successful, exit code 0 [2021-12-19 20:37:49,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,446 INFO L229 MonitoredProcess]: Starting monitored process 396 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (396)] Waiting until timeout for monitored process [2021-12-19 20:37:49,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:37:49,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:37:49,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:37:49,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (396)] Forceful destruction successful, exit code 0 [2021-12-19 20:37:49,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,498 INFO L229 MonitoredProcess]: Starting monitored process 397 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (397)] Waiting until timeout for monitored process [2021-12-19 20:37:49,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:37:49,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:37:49,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:37:49,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (397)] Ended with exit code 0 [2021-12-19 20:37:49,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,524 INFO L229 MonitoredProcess]: Starting monitored process 398 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (398)] Waiting until timeout for monitored process [2021-12-19 20:37:49,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:37:49,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:37:49,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:37:49,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (398)] Ended with exit code 0 [2021-12-19 20:37:49,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,546 INFO L229 MonitoredProcess]: Starting monitored process 399 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (399)] Waiting until timeout for monitored process [2021-12-19 20:37:49,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (399)] Ended with exit code 0 [2021-12-19 20:37:49,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,573 INFO L229 MonitoredProcess]: Starting monitored process 400 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (400)] Waiting until timeout for monitored process [2021-12-19 20:37:49,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (400)] Forceful destruction successful, exit code 0 [2021-12-19 20:37:49,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,599 INFO L229 MonitoredProcess]: Starting monitored process 401 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (401)] Waiting until timeout for monitored process [2021-12-19 20:37:49,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (401)] Ended with exit code 0 [2021-12-19 20:37:49,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,623 INFO L229 MonitoredProcess]: Starting monitored process 402 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (402)] Waiting until timeout for monitored process [2021-12-19 20:37:49,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (402)] Forceful destruction successful, exit code 0 [2021-12-19 20:37:49,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,664 INFO L229 MonitoredProcess]: Starting monitored process 403 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (403)] Waiting until timeout for monitored process [2021-12-19 20:37:49,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (403)] Ended with exit code 0 [2021-12-19 20:37:49,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,690 INFO L229 MonitoredProcess]: Starting monitored process 404 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (404)] Waiting until timeout for monitored process [2021-12-19 20:37:49,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (404)] Ended with exit code 0 [2021-12-19 20:37:49,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,717 INFO L229 MonitoredProcess]: Starting monitored process 405 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (405)] Waiting until timeout for monitored process [2021-12-19 20:37:49,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (405)] Ended with exit code 0 [2021-12-19 20:37:49,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,743 INFO L229 MonitoredProcess]: Starting monitored process 406 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (406)] Waiting until timeout for monitored process [2021-12-19 20:37:49,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (406)] Ended with exit code 0 [2021-12-19 20:37:49,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,768 INFO L229 MonitoredProcess]: Starting monitored process 407 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (407)] Waiting until timeout for monitored process [2021-12-19 20:37:49,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (407)] Ended with exit code 0 [2021-12-19 20:37:49,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,795 INFO L229 MonitoredProcess]: Starting monitored process 408 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (408)] Waiting until timeout for monitored process [2021-12-19 20:37:49,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:37:49,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (408)] Ended with exit code 0 [2021-12-19 20:37:49,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,821 INFO L229 MonitoredProcess]: Starting monitored process 409 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (409)] Waiting until timeout for monitored process [2021-12-19 20:37:49,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:37:49,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:37:49,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:37:49,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:37:49,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:37:49,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:37:49,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:37:49,834 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:37:49,840 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-19 20:37:49,840 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-19 20:37:49,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:37:49,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:49,841 INFO L229 MonitoredProcess]: Starting monitored process 410 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:37:49,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (410)] Waiting until timeout for monitored process [2021-12-19 20:37:49,842 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:37:49,847 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:37:49,847 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:37:49,847 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 64))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 64))_1 Supporting invariants [] [2021-12-19 20:37:49,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (409)] Ended with exit code 0 [2021-12-19 20:37:50,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (410)] Forceful destruction successful, exit code 0 [2021-12-19 20:37:53,549 INFO L297 tatePredicateManager]: 633 out of 635 supporting invariants were superfluous and have been removed [2021-12-19 20:37:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:37:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:37:53,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-19 20:37:53,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:37:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:37:54,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:37:54,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:37:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:37:54,380 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.18 stem predicates 2 loop predicates [2021-12-19 20:37:54,380 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 158 transitions. cyclomatic complexity: 42 Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:37:54,420 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 158 transitions. cyclomatic complexity: 42. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 138 states and 162 transitions. Complement of second has 4 states. [2021-12-19 20:37:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:37:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:37:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:37:54,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 109 letters. Loop has 2 letters. [2021-12-19 20:37:54,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:37:54,421 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:37:54,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:37:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:37:54,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-19 20:37:54,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:37:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:37:55,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:37:55,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:37:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:37:55,272 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.18 stem predicates 2 loop predicates [2021-12-19 20:37:55,272 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 158 transitions. cyclomatic complexity: 42 Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:37:55,311 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 158 transitions. cyclomatic complexity: 42. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 138 states and 162 transitions. Complement of second has 4 states. [2021-12-19 20:37:55,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:37:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:37:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:37:55,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 109 letters. Loop has 2 letters. [2021-12-19 20:37:55,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:37:55,312 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:37:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:37:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:37:55,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-19 20:37:55,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:37:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:37:56,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:37:56,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:37:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:37:56,143 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.18 stem predicates 2 loop predicates [2021-12-19 20:37:56,143 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 158 transitions. cyclomatic complexity: 42 Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:37:56,644 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 158 transitions. cyclomatic complexity: 42. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 262 states and 336 transitions. Complement of second has 40 states. [2021-12-19 20:37:56,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 18 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:37:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:37:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 119 transitions. [2021-12-19 20:37:56,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 119 transitions. Stem has 109 letters. Loop has 2 letters. [2021-12-19 20:37:56,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:37:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 119 transitions. Stem has 111 letters. Loop has 2 letters. [2021-12-19 20:37:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:37:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 119 transitions. Stem has 109 letters. Loop has 4 letters. [2021-12-19 20:37:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:37:56,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 262 states and 336 transitions. [2021-12-19 20:37:56,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:37:56,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 262 states to 255 states and 326 transitions. [2021-12-19 20:37:56,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-19 20:37:56,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-19 20:37:56,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 326 transitions. [2021-12-19 20:37:56,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:37:56,650 INFO L681 BuchiCegarLoop]: Abstraction has 255 states and 326 transitions. [2021-12-19 20:37:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 326 transitions. [2021-12-19 20:37:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 130. [2021-12-19 20:37:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.1538461538461537) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:37:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2021-12-19 20:37:56,653 INFO L704 BuchiCegarLoop]: Abstraction has 130 states and 150 transitions. [2021-12-19 20:37:56,653 INFO L587 BuchiCegarLoop]: Abstraction has 130 states and 150 transitions. [2021-12-19 20:37:56,653 INFO L425 BuchiCegarLoop]: ======== Iteration 43============ [2021-12-19 20:37:56,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 150 transitions. [2021-12-19 20:37:56,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:37:56,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:37:56,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:37:56,654 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2021-12-19 20:37:56,654 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:37:56,654 INFO L791 eck$LassoCheckResult]: Stem: 58768#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 58769#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 58770#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 58763#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 58764#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58765#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58766#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58767#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58771#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58818#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58817#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58816#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58815#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58814#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58813#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58812#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58811#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58810#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58809#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58808#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58807#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58806#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58805#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58804#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58803#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58802#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58801#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58800#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58799#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58798#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58797#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58796#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58795#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58794#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58793#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58792#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58791#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 58784#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 58783#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 58776#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 58772#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58773#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58891#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58890#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58774#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58775#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58781#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58777#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58778#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58888#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58887#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58886#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58885#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58883#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58882#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58881#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58880#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58878#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58877#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58876#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58875#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58873#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58872#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58871#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58870#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58868#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58867#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58866#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58865#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58863#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58862#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58861#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58860#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58858#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58857#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58856#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58855#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58853#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58852#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58851#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58850#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58848#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58847#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58846#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58845#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58843#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58842#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58841#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58840#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58838#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58837#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58836#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58835#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58833#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58832#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58831#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58830#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58828#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58827#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58826#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58825#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58823#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58822#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58821#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58820#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58789#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58788#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 58787#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 58785#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 58779#L517-3 [2021-12-19 20:37:56,655 INFO L793 eck$LassoCheckResult]: Loop: 58779#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 58780#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 58779#L517-3 [2021-12-19 20:37:56,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:37:56,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1880377963, now seen corresponding path program 40 times [2021-12-19 20:37:56,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:37:56,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392377442] [2021-12-19 20:37:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:37:56,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:37:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:37:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 496 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:37:57,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:37:57,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392377442] [2021-12-19 20:37:57,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392377442] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:37:57,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207033506] [2021-12-19 20:37:57,197 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 20:37:57,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:37:57,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:37:57,198 INFO L229 MonitoredProcess]: Starting monitored process 411 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:37:57,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (411)] Waiting until timeout for monitored process [2021-12-19 20:37:57,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 20:37:57,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:37:57,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-19 20:37:57,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:37:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 561 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:37:58,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:37:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 561 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:37:58,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207033506] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:37:58,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:37:58,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 58 [2021-12-19 20:37:58,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075591542] [2021-12-19 20:37:58,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:37:58,319 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:37:58,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:37:58,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 40 times [2021-12-19 20:37:58,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:37:58,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483070106] [2021-12-19 20:37:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:37:58,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:37:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:37:58,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:37:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:37:58,326 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:37:58,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:37:58,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-12-19 20:37:58,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=2657, Unknown=0, NotChecked=0, Total=3422 [2021-12-19 20:37:58,370 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. cyclomatic complexity: 40 Second operand has 59 states, 58 states have (on average 3.2241379310344827) internal successors, (187), 59 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:37:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:37:59,031 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2021-12-19 20:37:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-19 20:37:59,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 257 transitions. [2021-12-19 20:37:59,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:37:59,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 133 states and 153 transitions. [2021-12-19 20:37:59,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:37:59,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:37:59,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 153 transitions. [2021-12-19 20:37:59,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:37:59,033 INFO L681 BuchiCegarLoop]: Abstraction has 133 states and 153 transitions. [2021-12-19 20:37:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 153 transitions. [2021-12-19 20:37:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2021-12-19 20:37:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.1515151515151516) internal successors, (152), 131 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:37:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2021-12-19 20:37:59,035 INFO L704 BuchiCegarLoop]: Abstraction has 132 states and 152 transitions. [2021-12-19 20:37:59,035 INFO L587 BuchiCegarLoop]: Abstraction has 132 states and 152 transitions. [2021-12-19 20:37:59,036 INFO L425 BuchiCegarLoop]: ======== Iteration 44============ [2021-12-19 20:37:59,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 152 transitions. [2021-12-19 20:37:59,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:37:59,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:37:59,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:37:59,037 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2021-12-19 20:37:59,037 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:37:59,037 INFO L791 eck$LassoCheckResult]: Stem: 59866#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 59867#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 59868#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 59861#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 59862#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59863#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59864#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59865#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59869#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59915#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59914#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59913#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59912#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59911#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59910#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59909#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59908#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59907#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59906#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59905#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59904#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59903#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59902#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59901#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59900#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59899#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59898#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59897#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59896#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59895#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59894#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59893#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59892#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59891#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59890#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59889#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59888#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59887#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59886#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 59881#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 59880#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 59874#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 59870#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59871#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59878#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59875#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59872#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59873#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59991#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59990#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59989#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59987#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59986#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59985#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59984#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59982#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59981#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59980#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59979#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59977#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59976#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59975#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59974#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59972#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59971#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59970#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59969#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59967#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59966#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59965#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59964#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59962#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59961#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59960#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59959#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59957#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59956#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59955#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59954#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59952#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59951#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59950#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59949#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59947#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59946#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59945#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59944#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59942#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59941#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59940#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59939#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59937#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59936#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59935#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59934#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59932#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59931#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59930#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59929#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59927#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59926#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59925#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59924#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59922#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59921#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59920#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59919#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59918#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59885#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 59884#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 59882#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 59876#L517-3 [2021-12-19 20:37:59,037 INFO L793 eck$LassoCheckResult]: Loop: 59876#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 59877#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 59876#L517-3 [2021-12-19 20:37:59,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:37:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash 840077043, now seen corresponding path program 41 times [2021-12-19 20:37:59,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:37:59,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603576621] [2021-12-19 20:37:59,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:37:59,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:37:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:37:59,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:37:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:37:59,107 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:37:59,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:37:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 41 times [2021-12-19 20:37:59,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:37:59,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878571969] [2021-12-19 20:37:59,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:37:59,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:37:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:37:59,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:37:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:37:59,115 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:37:59,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:37:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash -139812168, now seen corresponding path program 23 times [2021-12-19 20:37:59,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:37:59,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704776597] [2021-12-19 20:37:59,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:37:59,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:37:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:37:59,147 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:37:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:37:59,183 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:39:14,203 WARN L227 SmtUtils]: Spent 1.25m on a formula simplification. DAG size of input: 648 DAG size of output: 428 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 20:39:18,117 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:39:18,117 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:39:18,117 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:39:18,117 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:39:18,117 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:39:18,117 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:18,117 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:39:18,117 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:39:18,117 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration44_Lasso [2021-12-19 20:39:18,117 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:39:18,117 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:39:18,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:31,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:39:32,222 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:39:32,223 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:39:32,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:32,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:32,224 INFO L229 MonitoredProcess]: Starting monitored process 412 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:39:32,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (412)] Waiting until timeout for monitored process [2021-12-19 20:39:32,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:39:32,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:39:32,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:39:32,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:39:32,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:39:32,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:39:32,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:39:32,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:39:32,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (412)] Forceful destruction successful, exit code 0 [2021-12-19 20:39:32,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:32,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:32,256 INFO L229 MonitoredProcess]: Starting monitored process 413 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:39:32,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (413)] Waiting until timeout for monitored process [2021-12-19 20:39:32,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:39:32,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:39:32,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:39:32,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:39:32,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:39:32,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:39:32,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:39:32,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:39:32,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (413)] Forceful destruction successful, exit code 0 [2021-12-19 20:39:32,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:32,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:32,292 INFO L229 MonitoredProcess]: Starting monitored process 414 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:39:32,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (414)] Waiting until timeout for monitored process [2021-12-19 20:39:32,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:39:32,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:39:32,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:39:32,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:39:32,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:39:32,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:39:32,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:39:32,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:39:32,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (414)] Forceful destruction successful, exit code 0 [2021-12-19 20:39:32,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:32,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:32,318 INFO L229 MonitoredProcess]: Starting monitored process 415 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:39:32,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (415)] Waiting until timeout for monitored process [2021-12-19 20:39:32,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:39:32,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:39:32,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:39:32,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:39:32,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:39:32,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:39:32,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:39:32,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:39:32,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (415)] Ended with exit code 0 [2021-12-19 20:39:32,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:32,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:32,346 INFO L229 MonitoredProcess]: Starting monitored process 416 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:39:32,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (416)] Waiting until timeout for monitored process [2021-12-19 20:39:32,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:39:32,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:39:32,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:39:32,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:39:32,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:39:32,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:39:32,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:39:32,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:39:32,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (416)] Ended with exit code 0 [2021-12-19 20:39:32,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:32,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:32,375 INFO L229 MonitoredProcess]: Starting monitored process 417 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:39:32,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (417)] Waiting until timeout for monitored process [2021-12-19 20:39:32,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:39:32,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:39:32,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:39:32,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:39:32,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:39:32,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:39:32,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:39:32,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:39:32,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (417)] Forceful destruction successful, exit code 0 [2021-12-19 20:39:32,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:32,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:32,404 INFO L229 MonitoredProcess]: Starting monitored process 418 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:39:32,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (418)] Waiting until timeout for monitored process [2021-12-19 20:39:32,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:39:32,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:39:32,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:39:32,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:39:32,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:39:32,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:39:32,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:39:32,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:39:32,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (418)] Forceful destruction successful, exit code 0 [2021-12-19 20:39:32,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:32,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:32,432 INFO L229 MonitoredProcess]: Starting monitored process 419 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:39:32,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (419)] Waiting until timeout for monitored process [2021-12-19 20:39:32,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:39:32,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:39:32,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:39:32,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:39:32,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:39:32,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:39:32,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:39:32,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:39:32,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (419)] Forceful destruction successful, exit code 0 [2021-12-19 20:39:32,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:32,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:32,460 INFO L229 MonitoredProcess]: Starting monitored process 420 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:39:32,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (420)] Waiting until timeout for monitored process [2021-12-19 20:39:32,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:39:32,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:39:32,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:39:32,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:39:32,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:39:32,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:39:32,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:39:32,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:39:32,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (420)] Forceful destruction successful, exit code 0 [2021-12-19 20:39:32,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:32,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:32,488 INFO L229 MonitoredProcess]: Starting monitored process 421 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:39:32,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (421)] Waiting until timeout for monitored process [2021-12-19 20:39:32,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:39:32,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:39:32,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:39:32,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:39:32,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:39:32,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:39:32,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:39:32,501 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:39:32,507 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-19 20:39:32,507 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:39:32,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:39:32,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:32,508 INFO L229 MonitoredProcess]: Starting monitored process 422 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:39:32,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (422)] Waiting until timeout for monitored process [2021-12-19 20:39:32,510 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:39:32,516 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:39:32,516 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:39:32,517 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 68))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0#1.base) (+ ULTIMATE.start_main_~numbers~0#1.offset 68))_2 Supporting invariants [] [2021-12-19 20:39:32,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (421)] Ended with exit code 0 [2021-12-19 20:39:32,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (422)] Forceful destruction successful, exit code 0 [2021-12-19 20:39:36,210 INFO L297 tatePredicateManager]: 633 out of 635 supporting invariants were superfluous and have been removed [2021-12-19 20:39:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:39:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:39:36,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-19 20:39:36,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:39:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:39:37,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:39:37,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:39:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:39:37,092 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.19 stem predicates 2 loop predicates [2021-12-19 20:39:37,092 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 152 transitions. cyclomatic complexity: 40 Second operand has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:39:37,132 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 152 transitions. cyclomatic complexity: 40. Second operand has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 133 states and 154 transitions. Complement of second has 4 states. [2021-12-19 20:39:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:39:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:39:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:39:37,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 111 letters. Loop has 2 letters. [2021-12-19 20:39:37,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:39:37,133 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:39:37,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:39:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:39:37,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-19 20:39:37,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:39:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:39:37,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:39:37,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:39:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:39:38,002 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.19 stem predicates 2 loop predicates [2021-12-19 20:39:38,002 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 152 transitions. cyclomatic complexity: 40 Second operand has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:39:38,043 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 152 transitions. cyclomatic complexity: 40. Second operand has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 133 states and 154 transitions. Complement of second has 4 states. [2021-12-19 20:39:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-19 20:39:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:39:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-19 20:39:38,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 111 letters. Loop has 2 letters. [2021-12-19 20:39:38,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:39:38,043 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 20:39:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:39:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:39:38,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-19 20:39:38,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:39:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:39:38,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:39:38,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:39:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:39:38,920 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.19 stem predicates 2 loop predicates [2021-12-19 20:39:38,920 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 152 transitions. cyclomatic complexity: 40 Second operand has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:39:39,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 152 transitions. cyclomatic complexity: 40. Second operand has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 163 states and 203 transitions. Complement of second has 42 states. [2021-12-19 20:39:39,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 19 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-19 20:39:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:39:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 125 transitions. [2021-12-19 20:39:39,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 125 transitions. Stem has 111 letters. Loop has 2 letters. [2021-12-19 20:39:39,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:39:39,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 125 transitions. Stem has 113 letters. Loop has 2 letters. [2021-12-19 20:39:39,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:39:39,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 125 transitions. Stem has 111 letters. Loop has 4 letters. [2021-12-19 20:39:39,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:39:39,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 203 transitions. [2021-12-19 20:39:39,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:39:39,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 158 states and 196 transitions. [2021-12-19 20:39:39,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 20:39:39,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 20:39:39,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 196 transitions. [2021-12-19 20:39:39,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:39:39,480 INFO L681 BuchiCegarLoop]: Abstraction has 158 states and 196 transitions. [2021-12-19 20:39:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 196 transitions. [2021-12-19 20:39:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2021-12-19 20:39:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.1532846715328466) internal successors, (158), 136 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:39:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2021-12-19 20:39:39,482 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 158 transitions. [2021-12-19 20:39:39,482 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 158 transitions. [2021-12-19 20:39:39,482 INFO L425 BuchiCegarLoop]: ======== Iteration 45============ [2021-12-19 20:39:39,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 158 transitions. [2021-12-19 20:39:39,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:39:39,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:39:39,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:39:39,483 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2021-12-19 20:39:39,483 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:39:39,484 INFO L791 eck$LassoCheckResult]: Stem: 64138#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 64139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 64140#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 64133#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 64134#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64135#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64136#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64137#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64141#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64184#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64183#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64182#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64181#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64180#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64179#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64178#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64177#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64176#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64175#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64174#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64173#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64172#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64171#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64170#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64169#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64168#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64167#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64166#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64165#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64164#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64163#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64162#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64161#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64160#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64159#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64158#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64157#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64156#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64155#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 64154#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 64153#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 64148#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 64142#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64143#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64268#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64267#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64144#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64145#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64151#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64146#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64147#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64265#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64264#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64263#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64262#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64260#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64259#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64258#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64257#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64255#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64254#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64253#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64252#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64250#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64249#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64248#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64247#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64245#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64244#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64243#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64242#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64240#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64239#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64238#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64237#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64235#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64234#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64233#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64232#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64230#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64229#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64228#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64227#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64225#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64224#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64223#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64222#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64220#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64219#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64218#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64217#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64215#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64214#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64213#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64212#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64210#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64209#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64208#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64207#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64205#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64204#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64203#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64202#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64200#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64199#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64198#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64197#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64195#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64194#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64193#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64192#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64191#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64188#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 64187#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 64185#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 64149#L517-3 [2021-12-19 20:39:39,484 INFO L793 eck$LassoCheckResult]: Loop: 64149#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 64150#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 64149#L517-3 [2021-12-19 20:39:39,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:39:39,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1215507768, now seen corresponding path program 42 times [2021-12-19 20:39:39,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:39:39,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272861682] [2021-12-19 20:39:39,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:39:39,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:39:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:39:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 561 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:39:39,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:39:39,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272861682] [2021-12-19 20:39:39,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272861682] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:39:39,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005403715] [2021-12-19 20:39:39,990 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-19 20:39:39,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:39:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:39:39,991 INFO L229 MonitoredProcess]: Starting monitored process 423 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:39:39,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (423)] Waiting until timeout for monitored process [2021-12-19 20:39:40,775 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2021-12-19 20:39:40,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:39:40,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-19 20:39:40,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:39:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 630 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:39:41,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:39:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 630 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:39:41,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005403715] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:39:41,768 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:39:41,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 61 [2021-12-19 20:39:41,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423801489] [2021-12-19 20:39:41,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:39:41,769 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:39:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:39:41,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 42 times [2021-12-19 20:39:41,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:39:41,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064882599] [2021-12-19 20:39:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:39:41,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:39:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:39:41,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:39:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:39:41,775 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:39:41,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:39:41,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-12-19 20:39:41,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=2937, Unknown=0, NotChecked=0, Total=3782 [2021-12-19 20:39:41,806 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. cyclomatic complexity: 42 Second operand has 62 states, 61 states have (on average 3.2295081967213113) internal successors, (197), 62 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:39:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:39:42,437 INFO L93 Difference]: Finished difference Result 232 states and 271 transitions. [2021-12-19 20:39:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-19 20:39:42,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 271 transitions. [2021-12-19 20:39:42,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:39:42,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 140 states and 161 transitions. [2021-12-19 20:39:42,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 20:39:42,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-12-19 20:39:42,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 161 transitions. [2021-12-19 20:39:42,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:39:42,438 INFO L681 BuchiCegarLoop]: Abstraction has 140 states and 161 transitions. [2021-12-19 20:39:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 161 transitions. [2021-12-19 20:39:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2021-12-19 20:39:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.1510791366906474) internal successors, (160), 138 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:39:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2021-12-19 20:39:42,440 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 160 transitions. [2021-12-19 20:39:42,440 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 160 transitions. [2021-12-19 20:39:42,440 INFO L425 BuchiCegarLoop]: ======== Iteration 46============ [2021-12-19 20:39:42,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 160 transitions. [2021-12-19 20:39:42,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-19 20:39:42,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:39:42,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:39:42,441 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2021-12-19 20:39:42,441 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:39:42,442 INFO L791 eck$LassoCheckResult]: Stem: 65296#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 65297#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet10#1, main_#t~post9#1, main_~k~0#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 65298#L526 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 65295#L526-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~k~0#1 := 0; 65291#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65292#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65293#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65294#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65299#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65347#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65346#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65345#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65344#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65343#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65342#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65341#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65340#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65339#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65338#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65337#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65336#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65335#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65334#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65333#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65332#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65331#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65330#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65329#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65328#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65327#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65326#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65325#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65324#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65323#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65322#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65321#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65320#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65319#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65318#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65317#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65316#L531-3 assume !!(main_~k~0#1 < main_~array_size~0#1);call write~int(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet10#1; 65311#L531-2 main_#t~post9#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 65310#L531-3 assume !(main_~k~0#1 < main_~array_size~0#1); 65305#L531-4 assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_#t~mem3#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 65300#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65301#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65309#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65304#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65302#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65303#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65428#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65427#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65426#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65424#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65423#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65422#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65421#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65419#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65418#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65417#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65416#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65414#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65413#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65412#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65411#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65409#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65408#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65407#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65406#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65404#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65403#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65402#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65401#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65399#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65398#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65397#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65396#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65394#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65393#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65392#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65391#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65389#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65388#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65387#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65386#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65384#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65383#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65382#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65381#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65379#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65378#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65377#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65376#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65374#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65373#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65372#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65371#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65369#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65368#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65367#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65366#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65364#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65363#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65362#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65361#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65359#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65358#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65357#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65356#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65354#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65353#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65352#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65351#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65350#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65315#L517-1 assume !(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1; 65314#L516-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 65312#L516-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 65307#L517-3 [2021-12-19 20:39:42,442 INFO L793 eck$LassoCheckResult]: Loop: 65307#L517-3 call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 65306#L517-1 assume !!(test_fun_#t~mem3#1 > 0);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post5#1 := test_fun_#t~mem4#1;call write~int(test_fun_#t~post5#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem4#1;havoc test_fun_#t~post5#1;test_fun_#t~post6#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 65307#L517-3 [2021-12-19 20:39:42,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:39:42,442 INFO L85 PathProgramCache]: Analyzing trace with hash 972467622, now seen corresponding path program 43 times [2021-12-19 20:39:42,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:39:42,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257675825] [2021-12-19 20:39:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:39:42,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:39:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:39:42,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:39:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:39:42,537 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:39:42,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:39:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 43 times [2021-12-19 20:39:42,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:39:42,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774802041] [2021-12-19 20:39:42,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:39:42,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:39:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:39:42,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:39:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:39:42,546 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:39:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:39:42,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1761484629, now seen corresponding path program 24 times [2021-12-19 20:39:42,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:39:42,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092167198] [2021-12-19 20:39:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:39:42,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:39:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:39:42,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:39:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:39:42,633 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace Killed by 15