./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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/termination-memory-alloca/java_Sequence-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:01:35,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:01:35,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:01:35,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:01:35,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:01:35,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:01:35,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:01:35,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:01:35,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:01:35,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:01:35,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:01:35,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:01:35,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:01:35,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:01:35,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:01:35,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:01:35,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:01:35,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:01:35,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:01:35,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:01:35,611 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:01:35,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:01:35,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:01:35,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:01:35,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:01:35,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:01:35,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:01:35,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:01:35,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:01:35,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:01:35,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:01:35,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:01:35,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:01:35,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:01:35,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:01:35,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:01:35,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:01:35,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:01:35,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:01:35,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:01:35,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:01:35,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:01:35,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 15:01:35,668 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:01:35,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:01:35,671 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:01:35,671 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:01:35,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:01:35,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:01:35,673 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:01:35,673 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:01:35,673 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:01:35,674 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:01:35,674 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:01:35,674 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:01:35,674 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:01:35,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:01:35,675 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:01:35,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:01:35,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:01:35,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:01:35,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:01:35,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:01:35,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:01:35,676 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:01:35,676 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:01:35,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:01:35,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:01:35,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:01:35,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:01:35,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:01:35,678 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:01:35,678 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 [2022-07-14 15:01:35,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:01:35,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:01:35,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:01:35,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:01:35,936 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:01:35,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2022-07-14 15:01:36,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65220661a/58023f328ee44cb3bf64f2c4ce315726/FLAG676b60077 [2022-07-14 15:01:36,438 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:01:36,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2022-07-14 15:01:36,452 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65220661a/58023f328ee44cb3bf64f2c4ce315726/FLAG676b60077 [2022-07-14 15:01:36,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65220661a/58023f328ee44cb3bf64f2c4ce315726 [2022-07-14 15:01:36,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:01:36,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:01:36,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:01:36,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:01:36,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:01:36,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:01:36" (1/1) ... [2022-07-14 15:01:36,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63429d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:36, skipping insertion in model container [2022-07-14 15:01:36,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:01:36" (1/1) ... [2022-07-14 15:01:36,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:01:36,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:01:37,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:01:37,106 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:01:37,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:01:37,190 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:01:37,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37 WrapperNode [2022-07-14 15:01:37,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:01:37,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:01:37,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:01:37,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:01:37,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37" (1/1) ... [2022-07-14 15:01:37,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37" (1/1) ... [2022-07-14 15:01:37,242 INFO L137 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2022-07-14 15:01:37,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:01:37,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:01:37,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:01:37,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:01:37,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37" (1/1) ... [2022-07-14 15:01:37,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37" (1/1) ... [2022-07-14 15:01:37,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37" (1/1) ... [2022-07-14 15:01:37,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37" (1/1) ... [2022-07-14 15:01:37,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37" (1/1) ... [2022-07-14 15:01:37,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37" (1/1) ... [2022-07-14 15:01:37,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37" (1/1) ... [2022-07-14 15:01:37,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:01:37,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:01:37,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:01:37,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:01:37,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37" (1/1) ... [2022-07-14 15:01:37,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:37,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:37,337 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) [2022-07-14 15:01:37,342 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 [2022-07-14 15:01:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:01:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:01:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:01:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:01:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:01:37,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:01:37,490 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:01:37,504 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:01:37,626 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:01:37,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:01:37,632 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:01:37,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:01:37 BoogieIcfgContainer [2022-07-14 15:01:37,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:01:37,635 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:01:37,635 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:01:37,638 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:01:37,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:01:37,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:01:36" (1/3) ... [2022-07-14 15:01:37,640 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39c2f87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:01:37, skipping insertion in model container [2022-07-14 15:01:37,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:01:37,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:01:37" (2/3) ... [2022-07-14 15:01:37,641 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39c2f87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:01:37, skipping insertion in model container [2022-07-14 15:01:37,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:01:37,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:01:37" (3/3) ... [2022-07-14 15:01:37,642 INFO L354 chiAutomizerObserver]: Analyzing ICFG java_Sequence-alloca.i [2022-07-14 15:01:37,681 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:01:37,681 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:01:37,681 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:01:37,681 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:01:37,681 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:01:37,681 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:01:37,681 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:01:37,682 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:01:37,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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) [2022-07-14 15:01:37,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 15:01:37,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:37,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:37,702 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:01:37,702 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:01:37,702 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:01:37,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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) [2022-07-14 15:01:37,704 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 15:01:37,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:37,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:37,704 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:01:37,704 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:01:37,709 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 5#L552-4true [2022-07-14 15:01:37,710 INFO L754 eck$LassoCheckResult]: Loop: 5#L552-4true call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 10#L552-1true assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 4#L552-3true call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 5#L552-4true [2022-07-14 15:01:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:37,715 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:01:37,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:37,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452977506] [2022-07-14 15:01:37,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:37,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:37,847 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:37,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:37,885 INFO L85 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2022-07-14 15:01:37,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:37,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228320349] [2022-07-14 15:01:37,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:37,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:37,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2022-07-14 15:01:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:37,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526514440] [2022-07-14 15:01:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:37,964 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:37,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:38,538 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:01:38,538 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:01:38,539 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:01:38,539 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:01:38,539 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:01:38,539 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:38,540 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:01:38,540 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:01:38,540 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Sequence-alloca.i_Iteration1_Lasso [2022-07-14 15:01:38,541 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:01:38,541 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:01:38,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:38,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:01:39,311 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:01:39,315 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:01:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,323 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) [2022-07-14 15:01:39,327 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 [2022-07-14 15:01:39,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:39,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:39,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:39,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,383 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 [2022-07-14 15:01:39,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,388 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) [2022-07-14 15:01:39,390 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 [2022-07-14 15:01:39,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:39,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:39,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:39,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,447 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 [2022-07-14 15:01:39,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,449 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) [2022-07-14 15:01:39,450 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 [2022-07-14 15:01:39,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:39,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:39,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:39,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,500 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 [2022-07-14 15:01:39,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,501 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) [2022-07-14 15:01:39,502 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 [2022-07-14 15:01:39,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:39,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:39,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:39,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:39,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,535 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 [2022-07-14 15:01:39,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,537 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) [2022-07-14 15:01:39,540 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 [2022-07-14 15:01:39,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:39,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:39,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:39,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,597 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 [2022-07-14 15:01:39,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,599 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) [2022-07-14 15:01:39,602 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 [2022-07-14 15:01:39,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:39,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:39,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:39,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:39,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-14 15:01:39,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,637 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) [2022-07-14 15:01:39,638 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 [2022-07-14 15:01:39,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 [2022-07-14 15:01:39,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:39,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:39,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-14 15:01:39,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,673 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) [2022-07-14 15:01:39,674 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 [2022-07-14 15:01:39,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 [2022-07-14 15:01:39,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:39,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:39,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:39,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,706 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 [2022-07-14 15:01:39,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,708 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) [2022-07-14 15:01:39,709 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 [2022-07-14 15:01:39,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:39,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:39,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:39,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:39,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-14 15:01:39,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,736 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) [2022-07-14 15:01:39,737 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 [2022-07-14 15:01:39,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:39,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:39,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:39,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:39,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,793 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 [2022-07-14 15:01:39,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,795 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) [2022-07-14 15:01:39,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 [2022-07-14 15:01:39,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:01:39,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:01:39,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:01:39,812 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 [2022-07-14 15:01:39,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,854 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 [2022-07-14 15:01:39,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,860 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) [2022-07-14 15:01:39,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:39,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:39,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:39,883 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 [2022-07-14 15:01:39,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:39,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:39,921 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) [2022-07-14 15:01:39,922 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 [2022-07-14 15:01:39,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:39,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:39,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:39,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:39,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:39,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:39,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:39,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:39,997 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 [2022-07-14 15:01:39,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:39,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:40,000 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) [2022-07-14 15:01:40,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:40,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:40,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:40,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:40,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:40,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:40,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:40,022 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 [2022-07-14 15:01:40,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:40,063 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 [2022-07-14 15:01:40,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:40,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:40,065 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) [2022-07-14 15:01:40,067 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 [2022-07-14 15:01:40,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:40,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:40,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:40,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:40,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:40,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:40,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:40,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:40,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:40,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:40,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:40,127 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) [2022-07-14 15:01:40,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:40,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:40,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:40,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:40,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:40,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:40,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:40,159 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 [2022-07-14 15:01:40,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:40,201 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 [2022-07-14 15:01:40,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:40,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:40,202 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) [2022-07-14 15:01:40,204 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 [2022-07-14 15:01:40,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:40,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:40,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:40,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:40,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:40,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:40,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:40,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:40,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:40,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:40,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:40,250 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) [2022-07-14 15:01:40,252 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 [2022-07-14 15:01:40,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:40,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:40,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:40,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:40,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:40,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:40,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:40,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:40,303 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 [2022-07-14 15:01:40,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:40,305 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) [2022-07-14 15:01:40,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:40,312 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 [2022-07-14 15:01:40,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:40,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:40,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:40,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:40,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:40,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:40,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:01:40,363 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 [2022-07-14 15:01:40,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:40,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:40,365 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) [2022-07-14 15:01:40,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:01:40,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:01:40,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:01:40,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:01:40,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:01:40,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:01:40,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:01:40,389 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 [2022-07-14 15:01:40,397 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:01:40,415 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-14 15:01:40,415 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-07-14 15:01:40,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:01:40,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:40,439 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) [2022-07-14 15:01:40,488 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:01:40,497 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 [2022-07-14 15:01:40,521 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:01:40,521 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:01:40,522 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 199 Supporting invariants [] [2022-07-14 15:01:40,551 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 [2022-07-14 15:01:40,605 INFO L293 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2022-07-14 15:01:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:40,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:01:40,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:40,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 15:01:40,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:40,801 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-07-14 15:01:40,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 50 [2022-07-14 15:01:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:01:40,966 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-14 15:01:40,967 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:01:41,024 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 25 states and 31 transitions. Complement of second has 10 states. [2022-07-14 15:01:41,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-14 15:01:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:01:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2022-07-14 15:01:41,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 2 letters. Loop has 3 letters. [2022-07-14 15:01:41,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:41,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 5 letters. Loop has 3 letters. [2022-07-14 15:01:41,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:41,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2022-07-14 15:01:41,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:01:41,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2022-07-14 15:01:41,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:01:41,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 11 states and 13 transitions. [2022-07-14 15:01:41,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-14 15:01:41,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-14 15:01:41,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2022-07-14 15:01:41,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:01:41,062 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-07-14 15:01:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2022-07-14 15:01:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-14 15:01:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:01:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-07-14 15:01:41,085 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-07-14 15:01:41,085 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-07-14 15:01:41,085 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:01:41,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2022-07-14 15:01:41,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:01:41,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:41,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:41,087 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 15:01:41,087 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:01:41,088 INFO L752 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 153#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 155#L552-1 assume !(main_#t~mem7#1 < 100);havoc main_#t~mem7#1; 156#L552-5 call write~int(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 157#L553-4 [2022-07-14 15:01:41,088 INFO L754 eck$LassoCheckResult]: Loop: 157#L553-4 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 159#L553-1 assume !!(main_#t~mem10#1 < 21);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 158#L553-3 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(3 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 157#L553-4 [2022-07-14 15:01:41,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:41,093 INFO L85 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2022-07-14 15:01:41,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:41,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102408919] [2022-07-14 15:01:41,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:41,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:01:41,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:01:41,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102408919] [2022-07-14 15:01:41,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102408919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:01:41,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:01:41,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:01:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197348842] [2022-07-14 15:01:41,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:01:41,196 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:01:41,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:41,196 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2022-07-14 15:01:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:41,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523905022] [2022-07-14 15:01:41,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:41,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:41,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:41,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:01:41,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:01:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:01:41,276 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:01:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:01:41,307 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-07-14 15:01:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 15:01:41,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2022-07-14 15:01:41,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:01:41,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2022-07-14 15:01:41,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-14 15:01:41,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-14 15:01:41,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2022-07-14 15:01:41,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:01:41,314 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-14 15:01:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2022-07-14 15:01:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-07-14 15:01:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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) [2022-07-14 15:01:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-07-14 15:01:41,316 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-14 15:01:41,316 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-14 15:01:41,316 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:01:41,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2022-07-14 15:01:41,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:01:41,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:41,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:41,319 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-14 15:01:41,319 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:01:41,319 INFO L752 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 186#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 187#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 184#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 185#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 188#L552-1 assume !(main_#t~mem7#1 < 100);havoc main_#t~mem7#1; 189#L552-5 call write~int(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 190#L553-4 [2022-07-14 15:01:41,319 INFO L754 eck$LassoCheckResult]: Loop: 190#L553-4 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 192#L553-1 assume !!(main_#t~mem10#1 < 21);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 191#L553-3 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(3 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 190#L553-4 [2022-07-14 15:01:41,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 149879881, now seen corresponding path program 1 times [2022-07-14 15:01:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200799510] [2022-07-14 15:01:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:41,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:01:41,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:01:41,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200799510] [2022-07-14 15:01:41,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200799510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:01:41,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603606754] [2022-07-14 15:01:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:41,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:01:41,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:41,460 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:01:41,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-14 15:01:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:41,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 15:01:41,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:41,597 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-14 15:01:41,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-14 15:01:41,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-14 15:01:41,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-14 15:01:41,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-14 15:01:41,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 15:01:41,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-07-14 15:01:41,759 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-14 15:01:41,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 68 [2022-07-14 15:01:41,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 15:01:41,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2022-07-14 15:01:42,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 15:01:42,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 15:01:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:01:42,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:01:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:01:42,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603606754] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:01:42,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:01:42,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-07-14 15:01:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663237782] [2022-07-14 15:01:42,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:01:42,121 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:01:42,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 2 times [2022-07-14 15:01:42,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:42,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308767560] [2022-07-14 15:01:42,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:42,137 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:42,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:01:42,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 15:01:42,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-07-14 15:01:42,204 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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) [2022-07-14 15:01:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:01:42,294 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-07-14 15:01:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 15:01:42,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2022-07-14 15:01:42,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:01:42,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 19 transitions. [2022-07-14 15:01:42,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-14 15:01:42,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-14 15:01:42,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2022-07-14 15:01:42,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:01:42,299 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-07-14 15:01:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2022-07-14 15:01:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-07-14 15:01:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:01:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-07-14 15:01:42,303 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-07-14 15:01:42,303 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-07-14 15:01:42,303 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:01:42,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2022-07-14 15:01:42,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:01:42,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:42,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:42,305 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1] [2022-07-14 15:01:42,305 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:01:42,305 INFO L752 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 280#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 281#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 282#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 277#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 278#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 283#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 293#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 292#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 290#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 291#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 289#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 288#L552-1 assume !(main_#t~mem7#1 < 100);havoc main_#t~mem7#1; 284#L552-5 call write~int(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 285#L553-4 [2022-07-14 15:01:42,305 INFO L754 eck$LassoCheckResult]: Loop: 285#L553-4 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 287#L553-1 assume !!(main_#t~mem10#1 < 21);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 286#L553-3 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(3 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 285#L553-4 [2022-07-14 15:01:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash -579836663, now seen corresponding path program 2 times [2022-07-14 15:01:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:42,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613981478] [2022-07-14 15:01:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:01:42,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:01:42,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613981478] [2022-07-14 15:01:42,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613981478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:01:42,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689041297] [2022-07-14 15:01:42,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:01:42,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:01:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:42,578 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:01:42,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-14 15:01:42,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:01:42,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:01:42,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 15:01:42,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:42,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-14 15:01:42,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 15:01:42,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-14 15:01:42,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-14 15:01:42,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 15:01:42,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 15:01:42,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 15:01:42,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 15:01:42,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 15:01:42,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-14 15:01:42,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 15:01:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:01:42,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:01:42,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_208 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99)) is different from false [2022-07-14 15:01:42,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_208 (Array Int Int)) (v_ArrVal_206 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (or (not (<= v_ArrVal_206 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_206)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99)))) is different from false [2022-07-14 15:01:42,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_206 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_205))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_206)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (not (<= v_ArrVal_206 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))))))) is different from false [2022-07-14 15:01:42,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_206 Int) (v_ArrVal_204 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_204)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_205))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (not (<= v_ArrVal_204 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))) (not (<= v_ArrVal_206 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_206)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99)))))) is different from false [2022-07-14 15:01:42,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_206 Int) (v_ArrVal_202 (Array Int Int)) (v_ArrVal_204 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_202))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_204)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_205))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (not (<= v_ArrVal_206 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))) (not (<= v_ArrVal_204 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_206)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99))))))) is different from false [2022-07-14 15:01:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-14 15:01:42,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689041297] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:01:42,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:01:42,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 24 [2022-07-14 15:01:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247844939] [2022-07-14 15:01:42,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:01:42,951 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:01:42,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 3 times [2022-07-14 15:01:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:42,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923861830] [2022-07-14 15:01:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:42,959 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:01:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:01:42,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:01:43,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:01:43,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 15:01:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=229, Unknown=5, NotChecked=190, Total=552 [2022-07-14 15:01:43,020 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand has 24 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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) [2022-07-14 15:01:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:01:43,230 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-14 15:01:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 15:01:43,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 31 transitions. [2022-07-14 15:01:43,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:01:43,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 28 transitions. [2022-07-14 15:01:43,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-14 15:01:43,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-14 15:01:43,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2022-07-14 15:01:43,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:01:43,233 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-07-14 15:01:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2022-07-14 15:01:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-07-14 15:01:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 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) [2022-07-14 15:01:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-07-14 15:01:43,235 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-14 15:01:43,235 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-14 15:01:43,235 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:01:43,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2022-07-14 15:01:43,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:01:43,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:01:43,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:01:43,236 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1, 1] [2022-07-14 15:01:43,236 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:01:43,236 INFO L752 eck$LassoCheckResult]: Stem: 447#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 448#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 451#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 452#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 472#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 453#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 454#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 449#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 450#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 471#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 470#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 469#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 468#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 467#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 466#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 465#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 464#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 463#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 461#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 462#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 460#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 459#L552-1 assume !(main_#t~mem7#1 < 100);havoc main_#t~mem7#1; 455#L552-5 call write~int(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 456#L553-4 [2022-07-14 15:01:43,236 INFO L754 eck$LassoCheckResult]: Loop: 456#L553-4 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 458#L553-1 assume !!(main_#t~mem10#1 < 21);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 457#L553-3 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(3 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 456#L553-4 [2022-07-14 15:01:43,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:01:43,237 INFO L85 PathProgramCache]: Analyzing trace with hash -733972789, now seen corresponding path program 3 times [2022-07-14 15:01:43,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:01:43,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633646937] [2022-07-14 15:01:43,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:01:43,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:01:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:01:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:01:43,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:01:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633646937] [2022-07-14 15:01:43,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633646937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:01:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117483234] [2022-07-14 15:01:43,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 15:01:43,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:01:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:01:43,645 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:01:43,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-14 15:01:43,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-14 15:01:43,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:01:43,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-14 15:01:43,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:01:43,840 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-14 15:01:43,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-14 15:01:43,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-14 15:01:43,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-14 15:01:43,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-07-14 15:01:43,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 15:01:43,989 INFO L356 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2022-07-14 15:01:43,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 69 [2022-07-14 15:01:44,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-14 15:01:44,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-14 15:01:44,069 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:01:44,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 15:01:44,156 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:01:44,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 15:01:44,233 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:01:44,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 15:01:44,303 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:01:44,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 15:01:44,379 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:01:44,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 15:01:44,475 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:01:44,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 15:01:44,559 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:01:44,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 15:01:44,668 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:01:44,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 15:01:44,760 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-14 15:01:44,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 15:01:44,863 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-07-14 15:01:44,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 40 [2022-07-14 15:01:44,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 15:01:44,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-14 15:01:44,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 15:01:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:01:44,935 INFO L328 TraceCheckSpWp]: Computing backward predicates...