./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ae007674 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/GulwaniJainKoskinen-2009PLDI-Fig1-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 d0878af360c86b536b5b3bc8d222f1c5ce26337b4ad6227d126c258cfe065cc9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 09:08:21,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 09:08:21,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 09:08:21,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 09:08:21,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 09:08:21,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 09:08:21,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 09:08:21,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 09:08:21,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 09:08:21,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 09:08:21,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 09:08:21,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 09:08:21,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 09:08:21,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 09:08:21,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 09:08:21,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 09:08:21,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 09:08:21,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 09:08:21,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 09:08:21,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 09:08:21,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 09:08:21,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 09:08:21,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 09:08:21,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 09:08:21,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 09:08:21,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 09:08:21,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 09:08:21,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 09:08:21,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 09:08:21,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 09:08:21,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 09:08:21,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 09:08:21,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 09:08:21,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 09:08:21,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 09:08:21,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 09:08:21,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 09:08:21,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 09:08:21,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 09:08:21,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 09:08:21,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 09:08:21,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-28 09:08:21,656 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 09:08:21,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 09:08:21,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 09:08:21,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 09:08:21,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 09:08:21,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 09:08:21,660 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 09:08:21,660 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-28 09:08:21,660 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-28 09:08:21,661 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-28 09:08:21,661 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-28 09:08:21,661 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-28 09:08:21,662 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-28 09:08:21,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 09:08:21,662 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 09:08:21,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 09:08:21,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 09:08:21,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-28 09:08:21,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-28 09:08:21,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-28 09:08:21,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 09:08:21,663 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-28 09:08:21,664 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 09:08:21,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-28 09:08:21,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 09:08:21,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 09:08:21,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 09:08:21,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 09:08:21,673 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-28 09:08:21,673 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 -> d0878af360c86b536b5b3bc8d222f1c5ce26337b4ad6227d126c258cfe065cc9 [2021-12-28 09:08:21,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 09:08:22,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 09:08:22,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 09:08:22,013 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 09:08:22,013 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 09:08:22,014 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i [2021-12-28 09:08:22,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ff44aec/b68df34eb59d41d5bdf2e689fe9ec26b/FLAG073868d20 [2021-12-28 09:08:22,544 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 09:08:22,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i [2021-12-28 09:08:22,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ff44aec/b68df34eb59d41d5bdf2e689fe9ec26b/FLAG073868d20 [2021-12-28 09:08:22,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ff44aec/b68df34eb59d41d5bdf2e689fe9ec26b [2021-12-28 09:08:22,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 09:08:22,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 09:08:22,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 09:08:22,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 09:08:22,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 09:08:22,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:08:22" (1/1) ... [2021-12-28 09:08:22,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e19db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:22, skipping insertion in model container [2021-12-28 09:08:22,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:08:22" (1/1) ... [2021-12-28 09:08:22,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 09:08:22,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 09:08:23,196 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:08:23,202 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 09:08:23,270 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:08:23,292 INFO L208 MainTranslator]: Completed translation [2021-12-28 09:08:23,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23 WrapperNode [2021-12-28 09:08:23,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 09:08:23,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 09:08:23,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 09:08:23,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 09:08:23,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23" (1/1) ... [2021-12-28 09:08:23,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23" (1/1) ... [2021-12-28 09:08:23,336 INFO L137 Inliner]: procedures = 110, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2021-12-28 09:08:23,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 09:08:23,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 09:08:23,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 09:08:23,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 09:08:23,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23" (1/1) ... [2021-12-28 09:08:23,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23" (1/1) ... [2021-12-28 09:08:23,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23" (1/1) ... [2021-12-28 09:08:23,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23" (1/1) ... [2021-12-28 09:08:23,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23" (1/1) ... [2021-12-28 09:08:23,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23" (1/1) ... [2021-12-28 09:08:23,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23" (1/1) ... [2021-12-28 09:08:23,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 09:08:23,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 09:08:23,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 09:08:23,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 09:08:23,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23" (1/1) ... [2021-12-28 09:08:23,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:23,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:23,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:23,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-28 09:08:23,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 09:08:23,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 09:08:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 09:08:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 09:08:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 09:08:23,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 09:08:23,512 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 09:08:23,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 09:08:23,677 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 09:08:23,682 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 09:08:23,695 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-28 09:08:23,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:08:23 BoogieIcfgContainer [2021-12-28 09:08:23,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 09:08:23,698 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-28 09:08:23,698 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-28 09:08:23,700 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-28 09:08:23,701 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:08:23,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.12 09:08:22" (1/3) ... [2021-12-28 09:08:23,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4318c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:08:23, skipping insertion in model container [2021-12-28 09:08:23,702 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:08:23,702 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:08:23" (2/3) ... [2021-12-28 09:08:23,702 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4318c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:08:23, skipping insertion in model container [2021-12-28 09:08:23,702 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:08:23,702 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:08:23" (3/3) ... [2021-12-28 09:08:23,703 INFO L388 chiAutomizerObserver]: Analyzing ICFG GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i [2021-12-28 09:08:23,772 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-28 09:08:23,773 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-28 09:08:23,773 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-28 09:08:23,773 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-28 09:08:23,773 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-28 09:08:23,773 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-28 09:08:23,773 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-28 09:08:23,774 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-28 09:08:23,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:23,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:23,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:23,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:23,810 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-28 09:08:23,810 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:23,810 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-28 09:08:23,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:23,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:23,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:23,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:23,814 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-28 09:08:23,814 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:23,819 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#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~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~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_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 13#L552true assume !main_#t~short9#1; 3#L552-2true assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 9#L556-2true [2021-12-28 09:08:23,821 INFO L793 eck$LassoCheckResult]: Loop: 9#L556-2true call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 12#L555-1true assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 8#L556true assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 9#L556-2true [2021-12-28 09:08:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash 925671, now seen corresponding path program 1 times [2021-12-28 09:08:23,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:23,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253154955] [2021-12-28 09:08:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:23,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:24,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:24,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253154955] [2021-12-28 09:08:24,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253154955] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:24,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:24,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 09:08:24,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130572589] [2021-12-28 09:08:24,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:24,060 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:24,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 1 times [2021-12-28 09:08:24,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:24,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548728682] [2021-12-28 09:08:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:24,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:24,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:24,133 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:24,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:08:24,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:08:24,334 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:24,347 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2021-12-28 09:08:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 09:08:24,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2021-12-28 09:08:24,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:24,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 8 transitions. [2021-12-28 09:08:24,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-28 09:08:24,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-28 09:08:24,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2021-12-28 09:08:24,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:08:24,358 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-12-28 09:08:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2021-12-28 09:08:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-12-28 09:08:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2021-12-28 09:08:24,378 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-12-28 09:08:24,378 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-12-28 09:08:24,384 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-28 09:08:24,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2021-12-28 09:08:24,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:24,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:24,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:24,385 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-28 09:08:24,385 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:24,386 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#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~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~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_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 40#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 34#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 35#L556-2 [2021-12-28 09:08:24,386 INFO L793 eck$LassoCheckResult]: Loop: 35#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 39#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 38#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 35#L556-2 [2021-12-28 09:08:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash 925609, now seen corresponding path program 1 times [2021-12-28 09:08:24,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:24,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890240488] [2021-12-28 09:08:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:24,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:24,413 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:24,435 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:24,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 2 times [2021-12-28 09:08:24,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:24,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465872491] [2021-12-28 09:08:24,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:24,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:24,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:24,452 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:24,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:24,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029994, now seen corresponding path program 1 times [2021-12-28 09:08:24,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:24,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380338694] [2021-12-28 09:08:24,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:24,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:24,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:24,549 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:25,407 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:08:25,408 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:08:25,408 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:08:25,408 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:08:25,408 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:08:25,408 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:25,408 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:08:25,408 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:08:25,409 INFO L133 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i_Iteration2_Lasso [2021-12-28 09:08:25,409 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:08:25,409 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:08:25,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:25,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:26,361 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:08:26,365 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:08:26,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-28 09:08:26,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:26,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:26,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:26,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-28 09:08:26,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-28 09:08:26,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:26,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:26,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:26,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-28 09:08:26,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-28 09:08:26,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 [2021-12-28 09:08:26,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:26,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:26,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:26,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,516 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-28 09:08:26,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:26,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:26,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:26,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:26,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-28 09:08:26,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:26,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:26,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:26,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:26,579 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,580 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-28 09:08:26,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:26,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:26,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,619 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 [2021-12-28 09:08:26,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,623 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-28 09:08:26,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:26,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:26,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:26,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:26,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,665 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-28 09:08:26,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:26,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:26,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-12-28 09:08:26,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,731 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-28 09:08:26,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:26,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:26,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:26,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:26,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,803 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-28 09:08:26,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:26,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:26,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:26,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:26,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,844 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-28 09:08:26,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:26,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:26,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:26,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2021-12-28 09:08:26,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,885 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-28 09:08:26,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:26,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:26,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,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 [2021-12-28 09:08:26,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,920 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-28 09:08:26,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:26,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:26,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:26,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-12-28 09:08:26,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:26,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:26,950 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:26,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-28 09:08:26,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:26,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:26,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:26,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:26,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:26,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:26,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:26,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:26,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:27,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:27,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,006 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:27,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:27,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:27,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:27,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:27,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:27,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:27,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:27,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-28 09:08:27,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:27,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-28 09:08:27,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,048 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-28 09:08:27,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:27,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:27,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:27,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:27,057 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-28 09:08:27,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:27,058 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-28 09:08:27,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:27,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:27,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-28 09:08:27,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,080 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-28 09:08:27,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:27,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:27,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:27,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:27,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:27,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:27,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:27,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:27,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:27,105 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 [2021-12-28 09:08:27,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,106 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-28 09:08:27,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:27,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:27,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:08:27,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:27,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:27,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:27,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:08:27,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:08:27,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:27,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:27,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,177 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-28 09:08:27,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:27,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:27,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:27,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:27,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:27,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:27,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:27,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:27,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:27,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,237 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-28 09:08:27,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:27,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:27,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:27,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:27,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:27,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:27,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:27,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:27,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-12-28 09:08:27,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,292 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:27,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:27,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:27,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:27,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:27,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:27,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:27,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-28 09:08:27,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:27,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-28 09:08:27,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,346 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-28 09:08:27,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:27,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:27,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:27,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:27,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:27,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:27,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:27,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:27,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-28 09:08:27,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,380 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-28 09:08:27,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:27,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:27,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:27,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:27,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:27,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:27,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:27,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:27,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-28 09:08:27,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,410 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-28 09:08:27,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:27,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:27,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:27,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:27,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:27,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:27,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:27,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:27,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-28 09:08:27,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,446 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-28 09:08:27,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:27,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:27,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:27,456 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-28 09:08:27,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:27,472 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-28 09:08:27,472 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-28 09:08:27,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:08:27,562 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-12-28 09:08:27,562 INFO L444 ModelExtractionUtils]: 7 out of 21 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-12-28 09:08:27,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:27,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:27,576 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:27,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-28 09:08:27,627 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:08:27,649 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2021-12-28 09:08:27,650 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:08:27,650 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1 + 3*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_1 >= 0] [2021-12-28 09:08:27,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:27,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:27,793 INFO L297 tatePredicateManager]: 22 out of 25 supporting invariants were superfluous and have been removed [2021-12-28 09:08:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:27,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-28 09:08:27,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:08:27,928 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 09:08:27,929 INFO L387 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-28 09:08:27,965 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2021-12-28 09:08:27,965 INFO L387 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2021-12-28 09:08:27,971 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2021-12-28 09:08:28,001 INFO L353 Elim1Store]: treesize reduction 25, result has 51.9 percent of original size [2021-12-28 09:08:28,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 71 [2021-12-28 09:08:28,047 INFO L387 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 [2021-12-28 09:08:28,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2021-12-28 09:08:28,115 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-28 09:08:28,129 INFO L387 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 11 treesize of output 7 [2021-12-28 09:08:28,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-28 09:08:28,143 INFO L387 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 9 treesize of output 7 [2021-12-28 09:08:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:28,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 09:08:28,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:08:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:28,351 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2021-12-28 09:08:28,351 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:28,450 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 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 13 states and 16 transitions. Complement of second has 9 states. [2021-12-28 09:08:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-28 09:08:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2021-12-28 09:08:28,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 4 letters. Loop has 3 letters. [2021-12-28 09:08:28,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:28,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 3 letters. [2021-12-28 09:08:28,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:28,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 4 letters. Loop has 6 letters. [2021-12-28 09:08:28,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:28,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2021-12-28 09:08:28,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:28,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2021-12-28 09:08:28,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-28 09:08:28,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-28 09:08:28,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2021-12-28 09:08:28,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:08:28,456 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-28 09:08:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2021-12-28 09:08:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-28 09:08:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) 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) [2021-12-28 09:08:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2021-12-28 09:08:28,458 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-28 09:08:28,458 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-28 09:08:28,458 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-28 09:08:28,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2021-12-28 09:08:28,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:28,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:28,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:28,459 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:28,459 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:28,459 INFO L791 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 215#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~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~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_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 223#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 212#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 213#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 222#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 216#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 217#L556-2 [2021-12-28 09:08:28,460 INFO L793 eck$LassoCheckResult]: Loop: 217#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 220#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 224#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 217#L556-2 [2021-12-28 09:08:28,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:28,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029996, now seen corresponding path program 1 times [2021-12-28 09:08:28,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:28,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769929203] [2021-12-28 09:08:28,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:28,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:28,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:28,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769929203] [2021-12-28 09:08:28,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769929203] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:08:28,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:08:28,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 09:08:28,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358448647] [2021-12-28 09:08:28,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:08:28,553 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:28,553 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 3 times [2021-12-28 09:08:28,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:28,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876177369] [2021-12-28 09:08:28,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:28,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:28,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:28,577 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:28,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:28,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 09:08:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 09:08:28,691 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:28,735 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-12-28 09:08:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 09:08:28,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2021-12-28 09:08:28,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:28,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 17 transitions. [2021-12-28 09:08:28,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-28 09:08:28,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-28 09:08:28,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2021-12-28 09:08:28,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:08:28,737 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-28 09:08:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2021-12-28 09:08:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2021-12-28 09:08:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-28 09:08:28,739 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-28 09:08:28,739 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-28 09:08:28,739 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-28 09:08:28,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2021-12-28 09:08:28,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:28,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:28,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:28,740 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 09:08:28,740 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:28,740 INFO L791 eck$LassoCheckResult]: Stem: 257#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 258#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~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~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_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 265#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 255#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 256#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 263#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 261#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 262#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 264#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 259#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 260#L556-2 [2021-12-28 09:08:28,740 INFO L793 eck$LassoCheckResult]: Loop: 260#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 266#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 267#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 260#L556-2 [2021-12-28 09:08:28,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash 658021387, now seen corresponding path program 1 times [2021-12-28 09:08:28,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:28,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191180971] [2021-12-28 09:08:28,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:28,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:28,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:28,790 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:28,791 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 4 times [2021-12-28 09:08:28,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:28,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232570891] [2021-12-28 09:08:28,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:28,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:28,797 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:28,802 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash 884417224, now seen corresponding path program 2 times [2021-12-28 09:08:28,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:28,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177126397] [2021-12-28 09:08:28,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:28,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:28,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:28,877 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:30,444 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:08:30,444 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:08:30,445 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:08:30,445 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:08:30,445 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:08:30,445 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:30,445 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:08:30,445 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:08:30,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i_Iteration4_Lasso [2021-12-28 09:08:30,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:08:30,446 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:08:30,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:30,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:08:31,358 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:08:31,358 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:08:31,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:31,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:31,368 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:31,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-28 09:08:31,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:31,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:31,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:31,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:31,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:31,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:31,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:31,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:31,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:31,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:31,430 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:31,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:31,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:31,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:31,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:31,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:31,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:31,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:31,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-28 09:08:31,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:31,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:31,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:31,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:31,484 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:31,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-28 09:08:31,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:31,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:31,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:31,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:31,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:31,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:31,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:31,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:31,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:31,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:31,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:31,545 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:31,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-28 09:08:31,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:31,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:31,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:31,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:31,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:31,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:31,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:31,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:31,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:31,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:31,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:31,608 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:31,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-28 09:08:31,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:31,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:31,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:31,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:08:31,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:31,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-28 09:08:31,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-28 09:08:31,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:08:31,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-28 09:08:31,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:31,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:31,635 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:31,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-28 09:08:31,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:08:31,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:08:31,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:08:31,642 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-28 09:08:31,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:08:31,652 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-28 09:08:31,652 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-28 09:08:31,686 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:08:31,709 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-12-28 09:08:31,709 INFO L444 ModelExtractionUtils]: 4 out of 21 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-12-28 09:08:31,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:08:31,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:31,710 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:08:31,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-28 09:08:31,712 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:08:31,718 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2021-12-28 09:08:31,718 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:08:31,718 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2 + 1 Supporting invariants [] [2021-12-28 09:08:31,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-28 09:08:31,798 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2021-12-28 09:08:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:31,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-28 09:08:31,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:08:31,873 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 09:08:31,874 INFO L387 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-28 09:08:31,908 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 09:08:31,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2021-12-28 09:08:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:31,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-28 09:08:31,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:08:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:31,998 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-28 09:08:31,998 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:32,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-28 09:08:32,067 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 23 transitions. Complement of second has 9 states. [2021-12-28 09:08:32,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-28 09:08:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2021-12-28 09:08:32,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 10 letters. Loop has 3 letters. [2021-12-28 09:08:32,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:32,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2021-12-28 09:08:32,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:32,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 10 letters. Loop has 6 letters. [2021-12-28 09:08:32,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:08:32,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2021-12-28 09:08:32,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:32,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2021-12-28 09:08:32,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-28 09:08:32,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-28 09:08:32,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2021-12-28 09:08:32,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:08:32,071 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-28 09:08:32,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2021-12-28 09:08:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-28 09:08:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-28 09:08:32,073 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-28 09:08:32,073 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-28 09:08:32,074 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-28 09:08:32,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2021-12-28 09:08:32,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-28 09:08:32,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:32,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:32,075 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1] [2021-12-28 09:08:32,075 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-28 09:08:32,075 INFO L791 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 460#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~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~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_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 468#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 457#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 458#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 469#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 475#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 474#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 473#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 470#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 471#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 467#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 461#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 462#L556-2 [2021-12-28 09:08:32,075 INFO L793 eck$LassoCheckResult]: Loop: 462#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 465#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 472#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 462#L556-2 [2021-12-28 09:08:32,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:32,076 INFO L85 PathProgramCache]: Analyzing trace with hash 884417226, now seen corresponding path program 3 times [2021-12-28 09:08:32,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:32,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441607672] [2021-12-28 09:08:32,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:32,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 09:08:32,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:32,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441607672] [2021-12-28 09:08:32,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441607672] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:08:32,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802917484] [2021-12-28 09:08:32,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-28 09:08:32,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:08:32,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:32,178 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 09:08:32,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-12-28 09:08:32,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-28 09:08:32,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 09:08:32,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-28 09:08:32,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:08:32,312 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 09:08:32,315 INFO L387 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-28 09:08:32,367 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 09:08:32,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2021-12-28 09:08:32,385 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-28 09:08:32,386 INFO L387 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 1 case distinctions, treesize of input 28 treesize of output 31 [2021-12-28 09:08:32,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2021-12-28 09:08:32,451 INFO L387 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 [2021-12-28 09:08:32,473 INFO L387 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 19 treesize of output 18 [2021-12-28 09:08:32,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-12-28 09:08:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:32,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 09:08:32,621 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 09:08:32,622 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2021-12-28 09:08:33,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_#t~malloc10#1.base_83| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_65| Int) (|ULTIMATE.start_main_~maxId~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_7 |v_ULTIMATE.start_main_~tmp~0#1.offset_65|))) (or (<= .cse0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_83| v_arrayElimArr_7) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|)) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_83| (store (select |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_83|) |v_ULTIMATE.start_main_~tmp~0#1.offset_65| v_ArrVal_210)) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|) v_ArrVal_210) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_83|) 0)) (not (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|) 1) v_ArrVal_210)) (not (<= .cse0 0))))) is different from false [2021-12-28 09:08:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:33,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802917484] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 09:08:33,484 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 09:08:33,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2021-12-28 09:08:33,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133136673] [2021-12-28 09:08:33,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 09:08:33,485 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:33,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:33,485 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 5 times [2021-12-28 09:08:33,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:33,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275378684] [2021-12-28 09:08:33,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:33,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:33,491 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:33,495 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:33,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:33,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-28 09:08:33,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=252, Unknown=1, NotChecked=32, Total=342 [2021-12-28 09:08:33,577 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:08:33,800 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2021-12-28 09:08:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 09:08:33,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2021-12-28 09:08:33,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-28 09:08:33,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 35 transitions. [2021-12-28 09:08:33,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-28 09:08:33,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-28 09:08:33,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 35 transitions. [2021-12-28 09:08:33,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:08:33,804 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2021-12-28 09:08:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 35 transitions. [2021-12-28 09:08:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-12-28 09:08:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:08:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2021-12-28 09:08:33,806 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2021-12-28 09:08:33,807 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2021-12-28 09:08:33,807 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-28 09:08:33,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2021-12-28 09:08:33,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-28 09:08:33,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:08:33,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:08:33,809 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1] [2021-12-28 09:08:33,809 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2021-12-28 09:08:33,810 INFO L791 eck$LassoCheckResult]: Stem: 628#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 629#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~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~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_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 636#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 626#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 627#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 634#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 652#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 651#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 649#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 630#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 631#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 653#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 632#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 633#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 635#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 639#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 650#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 645#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 646#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 644#L556-2 [2021-12-28 09:08:33,810 INFO L793 eck$LassoCheckResult]: Loop: 644#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 648#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 640#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 641#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 637#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 638#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 643#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 647#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 642#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 644#L556-2 [2021-12-28 09:08:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:33,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1816884246, now seen corresponding path program 4 times [2021-12-28 09:08:33,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:33,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639992675] [2021-12-28 09:08:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:33,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:08:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 09:08:34,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:08:34,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639992675] [2021-12-28 09:08:34,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639992675] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:08:34,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987519289] [2021-12-28 09:08:34,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-28 09:08:34,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:08:34,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:08:34,072 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 09:08:34,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-12-28 09:08:34,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-28 09:08:34,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 09:08:34,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-28 09:08:34,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:08:34,210 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 09:08:34,210 INFO L387 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-28 09:08:34,280 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-28 09:08:34,281 INFO L387 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 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-28 09:08:34,323 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-28 09:08:34,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-12-28 09:08:34,434 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-28 09:08:34,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2021-12-28 09:08:34,438 INFO L387 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 21 treesize of output 17 [2021-12-28 09:08:34,521 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 09:08:34,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2021-12-28 09:08:34,681 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 09:08:34,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 46 [2021-12-28 09:08:34,858 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 09:08:34,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 51 [2021-12-28 09:08:35,061 INFO L353 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-28 09:08:35,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 40 [2021-12-28 09:08:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:35,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 09:08:35,925 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 09:08:35,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 59 [2021-12-28 09:08:48,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_269 Int) (v_arrayElimArr_10 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_85| Int) (|ULTIMATE.start_main_~maxId~0#1.offset| Int) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| v_arrayElimArr_9)) (.cse2 (select v_arrayElimArr_9 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|)) (.cse1 (select v_arrayElimArr_8 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|)) (.cse0 (select v_arrayElimArr_10 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|))) (or (= .cse0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| v_arrayElimArr_10) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (not (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|) 1) v_ArrVal_269)) (= .cse1 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| v_arrayElimArr_8) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (= .cse2 (select (select .cse3 |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (not (<= .cse0 0)) (<= .cse2 (select (select .cse3 |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|)) (not (<= .cse2 (+ .cse1 1))) (not (<= .cse1 (+ .cse0 1))) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| (store (select |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85|) |v_ULTIMATE.start_main_~tmp~0#1.offset_68| v_ArrVal_269)) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|) v_ArrVal_269) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_85|) 0))))) is different from false [2021-12-28 09:08:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:08:48,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987519289] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 09:08:48,785 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 09:08:48,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 37 [2021-12-28 09:08:48,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971179086] [2021-12-28 09:08:48,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 09:08:48,786 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:08:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:08:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash -803259212, now seen corresponding path program 1 times [2021-12-28 09:08:48,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:08:48,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828934102] [2021-12-28 09:08:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:08:48,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:08:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:48,799 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:08:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:08:48,807 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:08:49,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:08:49,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-28 09:08:49,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1082, Unknown=2, NotChecked=70, Total=1406 [2021-12-28 09:08:49,173 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 6 Second operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:09:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:09:10,409 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2021-12-28 09:09:10,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-28 09:09:10,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 76 transitions. [2021-12-28 09:09:10,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-28 09:09:10,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 63 states and 68 transitions. [2021-12-28 09:09:10,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-28 09:09:10,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-28 09:09:10,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 68 transitions. [2021-12-28 09:09:10,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-28 09:09:10,414 INFO L681 BuchiCegarLoop]: Abstraction has 63 states and 68 transitions. [2021-12-28 09:09:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 68 transitions. [2021-12-28 09:09:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2021-12-28 09:09:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:09:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-12-28 09:09:10,418 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-28 09:09:10,419 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-28 09:09:10,419 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-28 09:09:10,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 50 transitions. [2021-12-28 09:09:10,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-28 09:09:10,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:09:10,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:09:10,420 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 5, 2, 1, 1, 1, 1] [2021-12-28 09:09:10,421 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2021-12-28 09:09:10,421 INFO L791 eck$LassoCheckResult]: Stem: 935#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 936#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~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~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_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 943#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 933#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 934#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 978#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 977#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 976#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 945#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 946#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 953#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 944#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 937#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 938#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 941#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 939#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 940#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 967#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 966#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 965#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 963#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 964#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 962#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 961#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 959#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 951#L556-2 [2021-12-28 09:09:10,421 INFO L793 eck$LassoCheckResult]: Loop: 951#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 960#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 947#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 948#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 952#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 958#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 957#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 956#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 955#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 950#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 954#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 949#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 951#L556-2 [2021-12-28 09:09:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:09:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash 636022350, now seen corresponding path program 5 times [2021-12-28 09:09:10,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:09:10,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098809339] [2021-12-28 09:09:10,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:09:10,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:09:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:09:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:09:10,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:09:10,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098809339] [2021-12-28 09:09:10,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098809339] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 09:09:10,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846648061] [2021-12-28 09:09:10,818 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-28 09:09:10,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 09:09:10,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:09:10,820 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 09:09:10,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-12-28 09:09:10,940 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-12-28 09:09:10,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 09:09:10,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-28 09:09:10,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:09:10,965 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 09:09:10,965 INFO L387 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-28 09:09:10,993 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-28 09:09:10,994 INFO L387 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 51 [2021-12-28 09:09:10,999 INFO L387 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 [2021-12-28 09:09:11,008 INFO L387 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 [2021-12-28 09:09:11,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-28 09:09:11,029 INFO L387 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 9 treesize of output 7 [2021-12-28 09:09:11,037 INFO L387 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 11 treesize of output 7 [2021-12-28 09:09:11,074 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 09:09:11,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2021-12-28 09:09:11,089 INFO L353 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-12-28 09:09:11,089 INFO L387 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 1 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 09:09:11,185 INFO L353 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-28 09:09:11,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 38 [2021-12-28 09:09:11,329 INFO L353 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2021-12-28 09:09:11,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 51 [2021-12-28 09:09:11,615 INFO L353 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2021-12-28 09:09:11,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 43 [2021-12-28 09:09:12,678 INFO L353 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2021-12-28 09:09:12,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2021-12-28 09:09:12,785 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 09:09:12,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 40 [2021-12-28 09:09:13,583 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 09:09:13,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 46 [2021-12-28 09:09:13,960 INFO L353 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-28 09:09:13,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 31 [2021-12-28 09:09:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:09:13,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 09:09:33,445 WARN L228 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)