./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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-crafted/4BitCounterPointer.c -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 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 16:57:34,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 16:57:34,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 16:57:34,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 16:57:34,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 16:57:34,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 16:57:34,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 16:57:34,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 16:57:34,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 16:57:34,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 16:57:34,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 16:57:34,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 16:57:34,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 16:57:34,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 16:57:34,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 16:57:34,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 16:57:34,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 16:57:34,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 16:57:34,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 16:57:34,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 16:57:34,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 16:57:34,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 16:57:34,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 16:57:34,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 16:57:34,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 16:57:34,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 16:57:34,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 16:57:34,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 16:57:34,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 16:57:34,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 16:57:34,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 16:57:34,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 16:57:34,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 16:57:34,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 16:57:34,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 16:57:34,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 16:57:34,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 16:57:34,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 16:57:34,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 16:57:34,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 16:57:34,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 16:57:34,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-15 16:57:34,595 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 16:57:34,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 16:57:34,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 16:57:34,596 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 16:57:34,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 16:57:34,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 16:57:34,597 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 16:57:34,598 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 16:57:34,598 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 16:57:34,598 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 16:57:34,599 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 16:57:34,599 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 16:57:34,599 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 16:57:34,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 16:57:34,599 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 16:57:34,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 16:57:34,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 16:57:34,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 16:57:34,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 16:57:34,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 16:57:34,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 16:57:34,600 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 16:57:34,600 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 16:57:34,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 16:57:34,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 16:57:34,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 16:57:34,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 16:57:34,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 16:57:34,601 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 16:57:34,602 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 16:57:34,603 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 -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2021-12-15 16:57:34,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 16:57:34,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 16:57:34,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 16:57:34,832 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 16:57:34,833 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 16:57:34,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2021-12-15 16:57:34,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9a94b67/5f148dbcc7474f48b035f5ed1e9f6aec/FLAG0970ee3c6 [2021-12-15 16:57:35,272 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 16:57:35,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2021-12-15 16:57:35,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9a94b67/5f148dbcc7474f48b035f5ed1e9f6aec/FLAG0970ee3c6 [2021-12-15 16:57:35,291 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9a94b67/5f148dbcc7474f48b035f5ed1e9f6aec [2021-12-15 16:57:35,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 16:57:35,296 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 16:57:35,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 16:57:35,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 16:57:35,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 16:57:35,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd47e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35, skipping insertion in model container [2021-12-15 16:57:35,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 16:57:35,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 16:57:35,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 16:57:35,453 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 16:57:35,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 16:57:35,473 INFO L208 MainTranslator]: Completed translation [2021-12-15 16:57:35,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35 WrapperNode [2021-12-15 16:57:35,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 16:57:35,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 16:57:35,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 16:57:35,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 16:57:35,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,503 INFO L137 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2021-12-15 16:57:35,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 16:57:35,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 16:57:35,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 16:57:35,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 16:57:35,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 16:57:35,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 16:57:35,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 16:57:35,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 16:57:35,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35" (1/1) ... [2021-12-15 16:57:35,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:35,548 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-15 16:57:35,553 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-15 16:57:35,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 16:57:35,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 16:57:35,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 16:57:35,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 16:57:35,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 16:57:35,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 16:57:35,624 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 16:57:35,625 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 16:57:35,814 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 16:57:35,818 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 16:57:35,818 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 16:57:35,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 04:57:35 BoogieIcfgContainer [2021-12-15 16:57:35,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 16:57:35,820 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 16:57:35,820 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 16:57:35,823 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 16:57:35,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 16:57:35,824 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 04:57:35" (1/3) ... [2021-12-15 16:57:35,824 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69dc838f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 04:57:35, skipping insertion in model container [2021-12-15 16:57:35,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 16:57:35,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:57:35" (2/3) ... [2021-12-15 16:57:35,825 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69dc838f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 04:57:35, skipping insertion in model container [2021-12-15 16:57:35,825 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 16:57:35,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 04:57:35" (3/3) ... [2021-12-15 16:57:35,826 INFO L388 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2021-12-15 16:57:35,885 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 16:57:35,885 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 16:57:35,886 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 16:57:35,886 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 16:57:35,886 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 16:57:35,886 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 16:57:35,886 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 16:57:35,886 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 16:57:35,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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-15 16:57:35,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-15 16:57:35,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:57:35,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:57:35,960 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 16:57:35,960 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 16:57:35,960 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 16:57:35,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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-15 16:57:35,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-15 16:57:35,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:57:35,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:57:35,962 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 16:57:35,962 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 16:57:35,966 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; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~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_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 6#L24-2true [2021-12-15 16:57:35,966 INFO L793 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 9#L15-1true assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 3#L16true assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 6#L24-2true [2021-12-15 16:57:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 16:57:35,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:35,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043488502] [2021-12-15 16:57:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:35,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:36,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:36,215 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2021-12-15 16:57:36,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:36,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112361353] [2021-12-15 16:57:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:36,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:36,232 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:36,241 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:36,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:36,244 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2021-12-15 16:57:36,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:36,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619670032] [2021-12-15 16:57:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:36,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:36,320 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:36,349 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:37,662 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 16:57:37,662 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 16:57:37,663 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 16:57:37,663 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 16:57:37,663 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 16:57:37,663 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:37,663 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 16:57:37,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 16:57:37,663 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2021-12-15 16:57:37,663 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 16:57:37,663 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 16:57:37,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:37,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:37,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:37,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:37,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:37,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:37,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:38,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:38,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:38,557 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 16:57:38,560 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 16:57:38,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:38,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:38,563 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-15 16:57:38,566 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-15 16:57:38,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:38,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:38,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:57:38,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:38,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:38,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:38,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:57:38,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:57:38,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:38,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:38,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:38,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:38,621 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-15 16:57:38,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:38,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:38,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:57:38,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:38,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:38,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:38,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:57:38,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:57:38,635 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-15 16:57:38,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:38,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:38,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:38,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:38,658 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-15 16:57:38,660 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-15 16:57:38,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:38,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:38,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:38,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:38,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:38,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:38,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:38,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:38,686 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-15 16:57:38,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:38,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:38,687 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-15 16:57:38,688 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-15 16:57:38,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:38,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:38,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:57:38,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:38,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:38,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:38,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:57:38,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:57:38,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:38,715 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-15 16:57:38,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:38,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:38,716 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-15 16:57:38,717 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-15 16:57:38,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:38,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:38,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:38,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:38,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:38,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:38,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:38,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:38,746 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-15 16:57:38,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:38,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:38,748 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-15 16:57:38,755 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-15 16:57:38,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:38,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:38,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:57:38,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:38,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:38,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:38,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:57:38,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:57:38,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:38,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:38,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:38,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:38,789 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-15 16:57:38,789 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-15 16:57:38,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:38,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:38,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:38,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:38,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:38,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:38,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:38,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:38,830 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-15 16:57:38,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:38,832 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-15 16:57:38,833 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-15 16:57:38,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:38,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:38,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:38,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:38,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:38,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:38,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:38,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:38,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:38,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:38,887 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-15 16:57:38,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:38,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:38,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:38,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:38,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:38,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:38,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:38,905 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-15 16:57:38,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:38,934 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-15 16:57:38,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:38,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:38,935 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-15 16:57:38,936 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-15 16:57:38,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:38,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:38,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:38,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:38,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:38,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:38,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:38,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:38,981 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-15 16:57:38,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:38,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:38,983 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-15 16:57:38,984 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-15 16:57:38,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:38,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:38,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:38,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:38,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:38,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:38,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:39,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:39,025 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-15 16:57:39,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:39,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:39,027 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-15 16:57:39,028 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-15 16:57:39,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:39,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:39,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:39,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:39,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:39,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:39,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:39,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:39,070 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-15 16:57:39,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:39,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:39,072 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-15 16:57:39,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:39,107 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-15 16:57:39,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:39,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:39,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:39,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:39,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:39,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:39,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:39,146 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-15 16:57:39,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:39,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:39,147 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-15 16:57:39,148 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-15 16:57:39,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:39,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:39,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:39,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:39,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:39,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:39,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:39,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:39,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-15 16:57:39,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:39,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:39,184 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-15 16:57:39,185 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-15 16:57:39,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:39,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:39,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:39,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:39,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:39,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:39,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:39,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:39,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:39,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:39,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:39,229 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-15 16:57:39,230 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-15 16:57:39,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:39,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:39,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:39,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:39,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:39,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:39,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:39,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:39,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:39,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:39,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:39,292 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-15 16:57:39,293 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-15 16:57:39,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:39,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:39,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:39,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:39,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:39,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:39,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:39,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 16:57:39,327 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-15 16:57:39,327 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-12-15 16:57:39,328 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:39,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:39,340 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-15 16:57:39,341 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-15 16:57:39,388 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 16:57:39,412 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 16:57:39,412 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 16:57:39,413 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2021-12-15 16:57:39,460 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-15 16:57:39,565 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2021-12-15 16:57:39,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:39,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 16:57:39,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:57:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:39,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 16:57:39,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:57:39,654 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-15 16:57:39,677 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 16:57:39,678 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:57:39,710 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 36 transitions. Complement of second has 8 states. [2021-12-15 16:57:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 16:57:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:57:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2021-12-15 16:57:39,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2021-12-15 16:57:39,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:57:39,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2021-12-15 16:57:39,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:57:39,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2021-12-15 16:57:39,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:57:39,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2021-12-15 16:57:39,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-15 16:57:39,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2021-12-15 16:57:39,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-15 16:57:39,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 16:57:39,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2021-12-15 16:57:39,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:57:39,725 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-12-15 16:57:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2021-12-15 16:57:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-15 16:57:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:57:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2021-12-15 16:57:39,741 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-12-15 16:57:39,741 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-12-15 16:57:39,741 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 16:57:39,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2021-12-15 16:57:39,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-15 16:57:39,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:57:39,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:57:39,743 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 16:57:39,743 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 16:57:39,743 INFO L791 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 248#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~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_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 253#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 252#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 243#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 244#L20 [2021-12-15 16:57:39,743 INFO L793 eck$LassoCheckResult]: Loop: 244#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 249#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 250#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 255#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 244#L20 [2021-12-15 16:57:39,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2021-12-15 16:57:39,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:39,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544016154] [2021-12-15 16:57:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:39,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:39,808 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-15 16:57:39,873 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-15 16:57:39,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:57:39,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544016154] [2021-12-15 16:57:39,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544016154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:57:39,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:57:39,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 16:57:39,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390312075] [2021-12-15 16:57:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:57:39,876 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 16:57:39,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:39,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2021-12-15 16:57:39,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:39,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062855299] [2021-12-15 16:57:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:39,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:39,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:39,890 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:39,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:57:39,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 16:57:39,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 16:57:39,997 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:57:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:57:40,046 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2021-12-15 16:57:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 16:57:40,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2021-12-15 16:57:40,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-15 16:57:40,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2021-12-15 16:57:40,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-15 16:57:40,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-15 16:57:40,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2021-12-15 16:57:40,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:57:40,048 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-12-15 16:57:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2021-12-15 16:57:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2021-12-15 16:57:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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-15 16:57:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2021-12-15 16:57:40,049 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2021-12-15 16:57:40,049 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2021-12-15 16:57:40,049 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 16:57:40,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2021-12-15 16:57:40,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-15 16:57:40,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:57:40,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:57:40,050 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-12-15 16:57:40,050 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 16:57:40,050 INFO L791 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 288#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~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_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 289#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 290#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 285#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 286#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 291#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 283#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 284#L20 [2021-12-15 16:57:40,050 INFO L793 eck$LassoCheckResult]: Loop: 284#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 292#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 294#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 295#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 284#L20 [2021-12-15 16:57:40,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2021-12-15 16:57:40,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:40,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596906897] [2021-12-15 16:57:40,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:40,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:40,089 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:40,130 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:40,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:40,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2021-12-15 16:57:40,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:40,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453700814] [2021-12-15 16:57:40,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:40,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:40,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:40,139 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:40,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:40,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2021-12-15 16:57:40,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:40,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757346044] [2021-12-15 16:57:40,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:40,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:57:40,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:57:40,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757346044] [2021-12-15 16:57:40,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757346044] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:57:40,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819371891] [2021-12-15 16:57:40,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:40,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:57:40,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:40,240 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 16:57:40,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-15 16:57:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:40,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 16:57:40,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:57:40,353 INFO L388 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 10 treesize of output 8 [2021-12-15 16:57:40,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 16:57:40,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 16:57:40,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 16:57:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 16:57:40,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:57:40,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset|) 0)) is different from false [2021-12-15 16:57:40,452 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 16:57:40,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2021-12-15 16:57:40,457 INFO L388 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 30 treesize of output 22 [2021-12-15 16:57:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 16:57:40,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819371891] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:57:40,479 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:57:40,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-15 16:57:40,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516943578] [2021-12-15 16:57:40,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:57:40,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:57:40,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 16:57:40,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2021-12-15 16:57:40,575 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-15 16:57:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:57:40,611 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2021-12-15 16:57:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 16:57:40,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2021-12-15 16:57:40,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 16:57:40,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2021-12-15 16:57:40,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-15 16:57:40,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-15 16:57:40,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2021-12-15 16:57:40,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:57:40,614 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-15 16:57:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2021-12-15 16:57:40,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2021-12-15 16:57:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:57:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2021-12-15 16:57:40,616 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-12-15 16:57:40,616 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-12-15 16:57:40,616 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 16:57:40,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2021-12-15 16:57:40,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 16:57:40,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:57:40,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:57:40,617 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-12-15 16:57:40,617 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-15 16:57:40,617 INFO L791 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 402#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~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_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 407#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 404#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 399#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 400#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 405#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 411#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 408#L20 [2021-12-15 16:57:40,617 INFO L793 eck$LassoCheckResult]: Loop: 408#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 410#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 398#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 403#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 412#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 408#L20 [2021-12-15 16:57:40,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:40,618 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 2 times [2021-12-15 16:57:40,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:40,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973828539] [2021-12-15 16:57:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:40,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:40,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:40,651 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:40,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:40,651 INFO L85 PathProgramCache]: Analyzing trace with hash 49698504, now seen corresponding path program 1 times [2021-12-15 16:57:40,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:40,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003204586] [2021-12-15 16:57:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:40,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:40,657 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:40,663 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:40,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1758681084, now seen corresponding path program 1 times [2021-12-15 16:57:40,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:40,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649239701] [2021-12-15 16:57:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:40,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:57:40,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:57:40,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649239701] [2021-12-15 16:57:40,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649239701] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:57:40,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384144813] [2021-12-15 16:57:40,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:40,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:57:40,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:40,758 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 16:57:40,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-15 16:57:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:40,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-15 16:57:40,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:57:40,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-15 16:57:40,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 16:57:40,928 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 16:57:40,929 INFO L388 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 22 treesize of output 26 [2021-12-15 16:57:40,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 16:57:40,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 16:57:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 16:57:40,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:57:40,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_523) |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset|) 0)) is different from false [2021-12-15 16:57:41,000 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_523 (Array Int Int)) (v_ArrVal_522 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_522) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_523) |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset|) 0)) (= 0 |c_ULTIMATE.start_main_#t~mem6#1|)) is different from false [2021-12-15 16:57:41,024 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-12-15 16:57:41,024 INFO L388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 50 [2021-12-15 16:57:41,033 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-15 16:57:41,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 67 treesize of output 55 [2021-12-15 16:57:41,039 INFO L388 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 40 treesize of output 36 [2021-12-15 16:57:41,043 INFO L388 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 22 treesize of output 20 [2021-12-15 16:57:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 16:57:41,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384144813] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:57:41,106 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:57:41,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2021-12-15 16:57:41,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299510995] [2021-12-15 16:57:41,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:57:41,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:57:41,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-15 16:57:41,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=117, Unknown=2, NotChecked=46, Total=210 [2021-12-15 16:57:41,241 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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-15 16:57:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:57:41,356 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2021-12-15 16:57:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 16:57:41,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2021-12-15 16:57:41,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2021-12-15 16:57:41,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 25 transitions. [2021-12-15 16:57:41,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-15 16:57:41,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-15 16:57:41,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2021-12-15 16:57:41,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:57:41,360 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-15 16:57:41,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2021-12-15 16:57:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2021-12-15 16:57:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:57:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2021-12-15 16:57:41,361 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-12-15 16:57:41,361 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-12-15 16:57:41,361 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 16:57:41,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2021-12-15 16:57:41,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 16:57:41,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:57:41,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:57:41,362 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-12-15 16:57:41,362 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-15 16:57:41,363 INFO L791 eck$LassoCheckResult]: Stem: 539#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 540#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~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_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 545#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 542#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 537#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 538#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 543#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 549#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 546#L20 [2021-12-15 16:57:41,363 INFO L793 eck$LassoCheckResult]: Loop: 546#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 548#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 536#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 541#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 550#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 546#L20 [2021-12-15 16:57:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:41,363 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 3 times [2021-12-15 16:57:41,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:41,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831043628] [2021-12-15 16:57:41,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:41,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:41,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:41,395 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash 49758086, now seen corresponding path program 1 times [2021-12-15 16:57:41,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:41,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883081405] [2021-12-15 16:57:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:41,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:41,413 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-15 16:57:41,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:57:41,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883081405] [2021-12-15 16:57:41,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883081405] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:57:41,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:57:41,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 16:57:41,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126081975] [2021-12-15 16:57:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:57:41,415 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 16:57:41,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:57:41,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 16:57:41,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 16:57:41,416 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:57:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:57:41,433 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2021-12-15 16:57:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 16:57:41,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2021-12-15 16:57:41,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 16:57:41,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 19 transitions. [2021-12-15 16:57:41,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-12-15 16:57:41,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-15 16:57:41,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2021-12-15 16:57:41,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:57:41,435 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-15 16:57:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2021-12-15 16:57:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-15 16:57:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:57:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-12-15 16:57:41,436 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-15 16:57:41,436 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-15 16:57:41,436 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 16:57:41,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2021-12-15 16:57:41,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 16:57:41,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:57:41,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:57:41,437 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-12-15 16:57:41,437 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2021-12-15 16:57:41,437 INFO L791 eck$LassoCheckResult]: Stem: 582#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 583#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~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_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 588#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 585#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 580#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 581#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 586#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 592#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 589#L20 [2021-12-15 16:57:41,437 INFO L793 eck$LassoCheckResult]: Loop: 589#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 590#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 593#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 578#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 579#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 584#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 587#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 589#L20 [2021-12-15 16:57:41,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 4 times [2021-12-15 16:57:41,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:41,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411459801] [2021-12-15 16:57:41,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:41,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:41,452 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:41,466 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1770012235, now seen corresponding path program 1 times [2021-12-15 16:57:41,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:41,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446946981] [2021-12-15 16:57:41,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:41,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:41,472 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:41,476 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:41,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 2 times [2021-12-15 16:57:41,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:41,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342973089] [2021-12-15 16:57:41,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:41,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:41,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:41,507 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:42,642 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 16:57:42,642 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 16:57:42,642 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 16:57:42,642 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 16:57:42,642 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 16:57:42,642 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:42,642 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 16:57:42,642 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 16:57:42,642 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration6_Lasso [2021-12-15 16:57:42,642 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 16:57:42,642 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 16:57:42,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:42,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:43,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:43,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:43,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:43,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:43,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:43,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:43,357 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 16:57:43,357 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 16:57:43,358 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:43,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:43,359 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-15 16:57:43,360 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-15 16:57:43,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:43,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:43,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:43,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:43,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:43,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:43,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:43,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:43,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:43,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:43,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:43,400 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-15 16:57:43,401 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-15 16:57:43,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:43,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:43,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:43,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:43,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:43,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:43,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:43,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:43,434 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-15 16:57:43,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:43,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:43,435 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-15 16:57:43,436 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-15 16:57:43,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:43,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:43,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:43,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:43,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:43,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:43,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:43,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:43,472 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-15 16:57:43,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:43,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:43,473 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-15 16:57:43,474 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-15 16:57:43,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:43,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:43,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:43,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:43,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:43,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:43,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:43,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:43,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:43,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:43,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:43,510 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-15 16:57:43,510 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-15 16:57:43,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:43,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:43,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:43,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:43,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:43,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:43,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:43,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:43,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-15 16:57:43,556 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:43,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:43,557 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-15 16:57:43,558 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-15 16:57:43,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:43,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:43,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:43,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:43,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:43,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:43,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:43,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:43,598 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-15 16:57:43,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:43,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:43,599 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-15 16:57:43,600 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-15 16:57:43,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:43,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:43,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:43,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:43,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:43,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:43,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:43,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:43,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-15 16:57:43,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:43,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:43,654 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-15 16:57:43,655 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-15 16:57:43,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:43,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:43,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:43,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:43,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:43,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:43,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:43,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:43,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-15 16:57:43,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:43,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:43,685 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-15 16:57:43,688 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-15 16:57:43,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:43,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:43,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:43,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:43,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:43,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:43,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:43,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:43,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-15 16:57:43,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:43,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:43,727 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-15 16:57:43,727 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-15 16:57:43,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:43,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:43,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:43,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:43,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:43,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:43,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:43,750 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 16:57:43,756 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-15 16:57:43,756 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-12-15 16:57:43,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:43,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:43,758 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-15 16:57:43,758 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-15 16:57:43,759 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 16:57:43,765 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 16:57:43,765 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 16:57:43,766 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem6#1) = -2*ULTIMATE.start_main_#t~mem6#1 + 1 Supporting invariants [] [2021-12-15 16:57:43,783 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-15 16:57:43,859 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2021-12-15 16:57:43,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:43,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 16:57:43,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:57:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:43,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-15 16:57:43,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:57:43,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-15 16:57:43,987 INFO L354 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2021-12-15 16:57:43,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 30 [2021-12-15 16:57:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:57:44,025 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2021-12-15 16:57:44,026 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:57:44,065 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 39 transitions. Complement of second has 11 states. [2021-12-15 16:57:44,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-15 16:57:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:57:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2021-12-15 16:57:44,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 8 letters. Loop has 7 letters. [2021-12-15 16:57:44,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:57:44,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 15 letters. Loop has 7 letters. [2021-12-15 16:57:44,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:57:44,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 8 letters. Loop has 14 letters. [2021-12-15 16:57:44,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:57:44,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2021-12-15 16:57:44,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-15 16:57:44,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 39 transitions. [2021-12-15 16:57:44,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-15 16:57:44,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-15 16:57:44,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2021-12-15 16:57:44,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:57:44,069 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-15 16:57:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2021-12-15 16:57:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2021-12-15 16:57:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:57:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-12-15 16:57:44,070 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-12-15 16:57:44,071 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-12-15 16:57:44,071 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 16:57:44,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2021-12-15 16:57:44,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-15 16:57:44,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:57:44,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:57:44,072 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2021-12-15 16:57:44,072 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 16:57:44,072 INFO L791 eck$LassoCheckResult]: Stem: 855#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~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_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 860#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 858#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 853#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 854#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 859#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 874#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 873#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 852#L24-2 [2021-12-15 16:57:44,072 INFO L793 eck$LassoCheckResult]: Loop: 852#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 857#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 851#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 852#L24-2 [2021-12-15 16:57:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:44,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 3 times [2021-12-15 16:57:44,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:44,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378290270] [2021-12-15 16:57:44,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:44,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:44,085 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:44,096 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:44,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:44,096 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2021-12-15 16:57:44,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:44,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053810443] [2021-12-15 16:57:44,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:44,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:44,100 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:44,102 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:44,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1467212283, now seen corresponding path program 4 times [2021-12-15 16:57:44,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:44,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897386602] [2021-12-15 16:57:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:44,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:44,115 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:57:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:57:44,125 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:57:45,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:45,487 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 16:57:45,487 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 16:57:45,487 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 16:57:45,487 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 16:57:45,487 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 16:57:45,487 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:45,487 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 16:57:45,487 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 16:57:45,487 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2021-12-15 16:57:45,488 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 16:57:45,488 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 16:57:45,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:45,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:45,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:45,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:45,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:45,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:45,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:45,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:45,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:57:46,118 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 16:57:46,118 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 16:57:46,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:46,120 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-15 16:57:46,121 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-15 16:57:46,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:46,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:46,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:57:46,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:46,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:46,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:46,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:57:46,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:57:46,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:46,145 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-15 16:57:46,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:46,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:46,146 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-15 16:57:46,147 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-15 16:57:46,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:46,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:46,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:46,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:46,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:46,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:46,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:46,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:46,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-12-15 16:57:46,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:46,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:46,182 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:57:46,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-15 16:57:46,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:46,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:46,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:57:46,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:46,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:46,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:46,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:57:46,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:57:46,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:46,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:46,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:46,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:46,217 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:57:46,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-15 16:57:46,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:46,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:46,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:46,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:46,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:46,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:46,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:46,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:57:46,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:46,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:46,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:46,244 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:57:46,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-15 16:57:46,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:57:46,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:57:46,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:57:46,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:57:46,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:57:46,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:57:46,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:57:46,273 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 16:57:46,277 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-15 16:57:46,278 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2021-12-15 16:57:46,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:57:46,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:46,279 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:57:46,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-15 16:57:46,333 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 16:57:46,350 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 16:57:46,350 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 16:57:46,350 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3 + 1 Supporting invariants [] [2021-12-15 16:57:46,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-15 16:57:46,437 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2021-12-15 16:57:46,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:46,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 16:57:46,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:57:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:46,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 16:57:46,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:57:46,503 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-15 16:57:46,503 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 16:57:46,504 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-15 16:57:46,518 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 61 states and 74 transitions. Complement of second has 7 states. [2021-12-15 16:57:46,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 16:57:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-15 16:57:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-15 16:57:46,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2021-12-15 16:57:46,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:57:46,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2021-12-15 16:57:46,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:57:46,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2021-12-15 16:57:46,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:57:46,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 74 transitions. [2021-12-15 16:57:46,521 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-12-15 16:57:46,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 62 transitions. [2021-12-15 16:57:46,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-15 16:57:46,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-12-15 16:57:46,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 62 transitions. [2021-12-15 16:57:46,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:57:46,522 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2021-12-15 16:57:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 62 transitions. [2021-12-15 16:57:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2021-12-15 16:57:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 46 states have internal predecessors, (58), 0 states have call successors, (0), 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-15 16:57:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2021-12-15 16:57:46,524 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2021-12-15 16:57:46,524 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2021-12-15 16:57:46,524 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 16:57:46,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 58 transitions. [2021-12-15 16:57:46,525 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-12-15 16:57:46,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:57:46,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:57:46,525 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2021-12-15 16:57:46,525 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2021-12-15 16:57:46,525 INFO L791 eck$LassoCheckResult]: Stem: 1147#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~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_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1155#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1178#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1145#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1146#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1177#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1175#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1170#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1171#L24 [2021-12-15 16:57:46,525 INFO L793 eck$LassoCheckResult]: Loop: 1171#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1185#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1184#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1183#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1181#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1182#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1180#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1179#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1171#L24 [2021-12-15 16:57:46,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:57:46,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2021-12-15 16:57:46,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:57:46,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954462287] [2021-12-15 16:57:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:46,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:57:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:46,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-15 16:57:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:57:46,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:57:46,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954462287] [2021-12-15 16:57:46,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954462287] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:57:46,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854223989] [2021-12-15 16:57:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:57:46,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:57:46,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:57:46,691 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 16:57:46,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-12-15 16:57:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:57:46,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-15 16:57:46,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:57:47,037 INFO L354 Elim1Store]: treesize reduction 489, result has 34.5 percent of original size [2021-12-15 16:57:47,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 31 case distinctions, treesize of input 510 treesize of output 486 [2021-12-15 16:57:47,063 INFO L388 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 25 treesize of output 24 [2021-12-15 16:57:47,075 INFO L388 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 46 treesize of output 42 [2021-12-15 16:57:47,093 INFO L388 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 25 treesize of output 24 [2021-12-15 16:57:47,131 INFO L388 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 5 treesize of output 3 [2021-12-15 16:57:47,137 INFO L388 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 5 treesize of output 3 [2021-12-15 16:57:47,240 INFO L354 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2021-12-15 16:57:47,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 83 [2021-12-15 16:57:47,402 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 16:57:47,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-12-15 16:57:47,434 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 16:57:47,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-12-15 16:57:47,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-15 16:57:47,716 INFO L388 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 16 treesize of output 12 [2021-12-15 16:57:48,134 INFO L388 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 16 treesize of output 12 [2021-12-15 16:57:48,197 INFO L388 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 16 treesize of output 12 [2021-12-15 16:57:48,746 INFO L388 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 217 treesize of output 214 [2021-12-15 16:57:49,130 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-15 16:57:49,212 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-15 16:57:49,616 INFO L388 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 381 treesize of output 376 [2021-12-15 16:57:49,636 INFO L388 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 5 treesize of output 3 [2021-12-15 16:57:49,777 INFO L388 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 5 treesize of output 3 [2021-12-15 16:57:50,320 INFO L388 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 5 treesize of output 3 [2021-12-15 16:57:50,334 INFO L388 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 5 treesize of output 3 [2021-12-15 16:57:50,349 INFO L388 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 5 treesize of output 3 [2021-12-15 16:57:50,430 INFO L388 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 5 treesize of output 3 [2021-12-15 16:57:50,451 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-15 16:57:50,490 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-15 16:57:50,610 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-15 16:57:50,658 INFO L388 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 5 treesize of output 3 [2021-12-15 16:57:54,015 INFO L354 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2021-12-15 16:57:54,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 446 treesize of output 432 [2021-12-15 16:57:57,714 INFO L388 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 15 treesize of output 11 [2021-12-15 16:57:57,965 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-12-15 16:57:57,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 91 [2021-12-15 16:57:58,177 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-12-15 16:57:58,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 265 [2021-12-15 16:58:00,234 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-15 16:58:00,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 60 [2021-12-15 16:58:00,933 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-15 16:58:00,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 120 treesize of output 120 [2021-12-15 16:58:01,304 INFO L354 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2021-12-15 16:58:01,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 80 treesize of output 80 [2021-12-15 16:58:01,350 INFO L388 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 5 treesize of output 3 [2021-12-15 16:58:01,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 16:58:01,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-12-15 16:58:01,390 INFO L388 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 5 treesize of output 3 [2021-12-15 16:58:01,441 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-12-15 16:58:01,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 115 [2021-12-15 16:58:01,902 INFO L388 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 5 treesize of output 3 [2021-12-15 16:58:02,018 INFO L388 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 5 treesize of output 3 [2021-12-15 16:58:02,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 16:58:02,273 INFO L388 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 15 treesize of output 11 [2021-12-15 16:58:02,281 INFO L388 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 5 treesize of output 3 [2021-12-15 16:58:02,895 INFO L354 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2021-12-15 16:58:02,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 183 [2021-12-15 16:58:06,080 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-12-15 16:58:06,080 INFO L388 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 2 case distinctions, treesize of input 53 treesize of output 51 [2021-12-15 16:58:06,150 INFO L388 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 5 treesize of output 3 [2021-12-15 16:58:06,169 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-15 16:58:06,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 26 [2021-12-15 16:58:06,458 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-12-15 16:58:06,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 37 [2021-12-15 16:58:06,488 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-12-15 16:58:06,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 79 [2021-12-15 16:58:06,740 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-15 16:58:06,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 26 [2021-12-15 16:58:06,756 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-12-15 16:58:06,756 INFO L388 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 2 case distinctions, treesize of input 86 treesize of output 76 [2021-12-15 16:58:06,836 INFO L388 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 5 treesize of output 3 [2021-12-15 16:58:07,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 16:58:07,046 INFO L388 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 15 treesize of output 11 [2021-12-15 16:58:07,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 16:58:07,050 INFO L388 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 15 treesize of output 11 [2021-12-15 16:58:07,070 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-12-15 16:58:07,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 72 [2021-12-15 16:58:07,094 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 16:58:07,095 INFO L388 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 27 treesize of output 19 [2021-12-15 16:58:07,131 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 16:58:07,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 24 [2021-12-15 16:58:07,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 16:58:07,141 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 16:58:07,141 INFO L388 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 22 treesize of output 16 [2021-12-15 16:58:07,219 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 16:58:07,219 INFO L388 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 18 treesize of output 24 [2021-12-15 16:58:07,318 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 16:58:07,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 35 [2021-12-15 16:58:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:07,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:58:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:07,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854223989] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:58:07,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:58:07,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2021-12-15 16:58:07,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513939551] [2021-12-15 16:58:07,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:58:07,434 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 16:58:07,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:07,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2021-12-15 16:58:07,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:07,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645997068] [2021-12-15 16:58:07,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:07,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:07,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:07,451 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:07,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:58:07,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-15 16:58:07,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-15 16:58:07,685 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. cyclomatic complexity: 18 Second operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:58:07,825 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2021-12-15 16:58:07,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 16:58:07,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2021-12-15 16:58:07,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-15 16:58:07,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2021-12-15 16:58:07,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-15 16:58:07,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-15 16:58:07,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2021-12-15 16:58:07,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:58:07,827 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2021-12-15 16:58:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2021-12-15 16:58:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-15 16:58:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2021-12-15 16:58:07,829 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2021-12-15 16:58:07,829 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2021-12-15 16:58:07,829 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 16:58:07,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2021-12-15 16:58:07,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-15 16:58:07,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:58:07,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:58:07,829 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1] [2021-12-15 16:58:07,829 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 16:58:07,829 INFO L791 eck$LassoCheckResult]: Stem: 1303#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1304#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~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_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1308#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1322#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1323#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1321#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1319#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1316#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1311#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1306#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1307#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1301#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1302#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1326#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1315#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1312#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1300#L24-2 [2021-12-15 16:58:07,830 INFO L793 eck$LassoCheckResult]: Loop: 1300#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1305#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1299#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1300#L24-2 [2021-12-15 16:58:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash -697316797, now seen corresponding path program 5 times [2021-12-15 16:58:07,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:07,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503922384] [2021-12-15 16:58:07,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:07,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 16:58:07,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:58:07,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503922384] [2021-12-15 16:58:07,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503922384] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 16:58:07,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883988520] [2021-12-15 16:58:07,900 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 16:58:07,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 16:58:07,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:07,916 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 16:58:07,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-12-15 16:58:08,015 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-15 16:58:08,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 16:58:08,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-15 16:58:08,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:08,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-15 16:58:08,090 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 16:58:08,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2021-12-15 16:58:08,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 16:58:08,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-15 16:58:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 16:58:08,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 16:58:08,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1143 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|)))) is different from false [2021-12-15 16:58:08,216 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-12-15 16:58:08,217 INFO L388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 39 [2021-12-15 16:58:08,221 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-15 16:58:08,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 29 [2021-12-15 16:58:08,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2021-12-15 16:58:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2021-12-15 16:58:08,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883988520] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 16:58:08,239 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 16:58:08,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2021-12-15 16:58:08,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323007381] [2021-12-15 16:58:08,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 16:58:08,243 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 16:58:08,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:08,243 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2021-12-15 16:58:08,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:08,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496307546] [2021-12-15 16:58:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:08,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:08,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:08,257 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:08,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:58:08,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-15 16:58:08,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2021-12-15 16:58:08,297 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:08,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:58:08,439 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2021-12-15 16:58:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 16:58:08,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions. [2021-12-15 16:58:08,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2021-12-15 16:58:08,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 32 transitions. [2021-12-15 16:58:08,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-15 16:58:08,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-12-15 16:58:08,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 32 transitions. [2021-12-15 16:58:08,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 16:58:08,443 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-12-15 16:58:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 32 transitions. [2021-12-15 16:58:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2021-12-15 16:58:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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-15 16:58:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-12-15 16:58:08,445 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-12-15 16:58:08,445 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-12-15 16:58:08,445 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 16:58:08,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 25 transitions. [2021-12-15 16:58:08,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2021-12-15 16:58:08,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:58:08,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:58:08,445 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2021-12-15 16:58:08,445 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2021-12-15 16:58:08,445 INFO L791 eck$LassoCheckResult]: Stem: 1495#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1496#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~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_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1499#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1508#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1507#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1506#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1505#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1504#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1500#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1497#L24-2 [2021-12-15 16:58:08,445 INFO L793 eck$LassoCheckResult]: Loop: 1497#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1498#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1493#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1494#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1510#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1509#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1503#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1501#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1502#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1516#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1515#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1514#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1513#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1512#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1511#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1497#L24-2 [2021-12-15 16:58:08,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 6 times [2021-12-15 16:58:08,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:08,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655014511] [2021-12-15 16:58:08,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:08,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:08,461 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:08,486 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:08,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1164675892, now seen corresponding path program 1 times [2021-12-15 16:58:08,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:08,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237935444] [2021-12-15 16:58:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:08,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:08,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:08,512 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 1 times [2021-12-15 16:58:08,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:08,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834387193] [2021-12-15 16:58:08,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:08,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:08,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:08,549 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:10,282 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 16:58:10,282 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 16:58:10,282 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 16:58:10,282 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 16:58:10,282 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 16:58:10,282 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:10,282 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 16:58:10,282 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 16:58:10,282 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration10_Lasso [2021-12-15 16:58:10,282 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 16:58:10,282 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 16:58:10,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:10,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:10,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:10,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:10,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:10,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:10,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:10,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:10,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:11,119 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 16:58:11,120 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 16:58:11,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:11,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:11,121 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:11,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-15 16:58:11,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:11,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:11,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:11,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:11,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:11,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:11,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:11,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:11,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:11,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-15 16:58:11,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:11,145 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:11,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-15 16:58:11,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:11,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:11,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:11,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:11,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:11,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:11,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:11,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:11,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:11,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-12-15 16:58:11,169 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:11,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:11,170 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:11,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-15 16:58:11,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:11,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:11,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:11,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:11,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:11,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:11,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:11,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:11,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-15 16:58:11,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:11,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:11,198 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:11,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-15 16:58:11,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:11,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:11,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:11,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:11,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:11,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:11,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:11,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:11,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-15 16:58:11,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:11,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:11,228 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:11,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-15 16:58:11,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:11,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:11,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:11,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:11,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:11,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:11,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:11,241 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 16:58:11,244 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-15 16:58:11,244 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2021-12-15 16:58:11,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:11,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:11,245 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:11,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-15 16:58:11,248 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 16:58:11,256 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 16:58:11,256 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 16:58:11,256 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2021-12-15 16:58:11,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:11,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-15 16:58:11,402 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2021-12-15 16:58:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:11,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 16:58:11,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:11,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-15 16:58:11,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:11,511 INFO L354 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2021-12-15 16:58:11,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 45 [2021-12-15 16:58:11,614 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 16:58:11,614 INFO L388 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 55 treesize of output 58 [2021-12-15 16:58:11,689 INFO L354 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2021-12-15 16:58:11,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 74 [2021-12-15 16:58:11,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 68 [2021-12-15 16:58:12,048 INFO L354 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2021-12-15 16:58:12,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 30 [2021-12-15 16:58:12,122 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 16:58:12,122 INFO L388 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 19 treesize of output 18 [2021-12-15 16:58:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:12,145 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2021-12-15 16:58:12,145 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 25 transitions. cyclomatic complexity: 2 Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:12,401 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 25 transitions. cyclomatic complexity: 2. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 42 transitions. Complement of second has 24 states. [2021-12-15 16:58:12,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2021-12-15 16:58:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2021-12-15 16:58:12,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 23 transitions. Stem has 9 letters. Loop has 15 letters. [2021-12-15 16:58:12,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:12,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 23 transitions. Stem has 24 letters. Loop has 15 letters. [2021-12-15 16:58:12,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:12,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 23 transitions. Stem has 9 letters. Loop has 30 letters. [2021-12-15 16:58:12,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:12,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 42 transitions. [2021-12-15 16:58:12,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 16:58:12,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 42 transitions. [2021-12-15 16:58:12,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-15 16:58:12,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-15 16:58:12,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2021-12-15 16:58:12,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:58:12,404 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-12-15 16:58:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2021-12-15 16:58:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2021-12-15 16:58:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 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-15 16:58:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-12-15 16:58:12,406 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-15 16:58:12,406 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-15 16:58:12,406 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 16:58:12,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 36 transitions. [2021-12-15 16:58:12,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 16:58:12,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:58:12,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:58:12,407 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2021-12-15 16:58:12,407 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2021-12-15 16:58:12,407 INFO L791 eck$LassoCheckResult]: Stem: 1862#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1863#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~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_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1870#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1883#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1882#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1881#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1880#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1879#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1871#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1872#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1865#L15-1 [2021-12-15 16:58:12,407 INFO L793 eck$LassoCheckResult]: Loop: 1865#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1858#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1859#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1886#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1884#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1876#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1875#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1864#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1865#L15-1 [2021-12-15 16:58:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash 694263416, now seen corresponding path program 7 times [2021-12-15 16:58:12,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:12,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403560139] [2021-12-15 16:58:12,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:12,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:12,419 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:12,437 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:12,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:12,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1728898916, now seen corresponding path program 2 times [2021-12-15 16:58:12,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:12,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657770424] [2021-12-15 16:58:12,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:12,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:12,442 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:12,445 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:12,446 INFO L85 PathProgramCache]: Analyzing trace with hash -106541037, now seen corresponding path program 2 times [2021-12-15 16:58:12,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:12,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153730803] [2021-12-15 16:58:12,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:12,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:12,483 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:12,493 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:14,063 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 16:58:14,063 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 16:58:14,063 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 16:58:14,063 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 16:58:14,063 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 16:58:14,063 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:14,063 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 16:58:14,063 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 16:58:14,064 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration11_Lasso [2021-12-15 16:58:14,064 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 16:58:14,064 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 16:58:14,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:14,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:14,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:14,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:14,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:14,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:14,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:14,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:14,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:14,878 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 16:58:14,878 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 16:58:14,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:14,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:14,879 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:14,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-15 16:58:14,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:14,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:14,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:14,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:14,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:14,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:14,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:14,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:14,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:14,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-15 16:58:14,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:14,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:14,911 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:14,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-15 16:58:14,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:14,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:14,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:14,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:14,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:14,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:14,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:14,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:14,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:14,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-15 16:58:14,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:14,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:14,935 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:14,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-15 16:58:14,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:14,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:14,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:14,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:14,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:14,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:14,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:14,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:14,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:14,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-15 16:58:14,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:14,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:14,960 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:14,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-15 16:58:14,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:14,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:14,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:14,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:14,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:14,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:14,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:14,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:14,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:14,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:14,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,000 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-15 16:58:15,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:15,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:15,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:15,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:15,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:15,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,027 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-15 16:58:15,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:15,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:15,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:15,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:15,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:15,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-15 16:58:15,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,066 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-15 16:58:15,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:15,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:15,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:15,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:15,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-15 16:58:15,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,092 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-15 16:58:15,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:15,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:15,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:15,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:15,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-15 16:58:15,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,128 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-15 16:58:15,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:15,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:15,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:15,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:15,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-12-15 16:58:15,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,157 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-15 16:58:15,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:15,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:15,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:15,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:15,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-12-15 16:58:15,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,186 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-15 16:58:15,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:15,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:15,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:15,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:15,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:15,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,216 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-15 16:58:15,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:15,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:15,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:15,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:15,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-12-15 16:58:15,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,267 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-15 16:58:15,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:15,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:15,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:15,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:15,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-12-15 16:58:15,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,313 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-15 16:58:15,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:15,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:15,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:15,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:15,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-12-15 16:58:15,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,342 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-15 16:58:15,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:15,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:15,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:15,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:15,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:15,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,372 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-15 16:58:15,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:15,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:15,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:15,380 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-15 16:58:15,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:15,383 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-15 16:58:15,383 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-15 16:58:15,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 16:58:15,415 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-15 16:58:15,416 INFO L444 ModelExtractionUtils]: 0 out of 11 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-15 16:58:15,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:15,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:15,417 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:15,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-15 16:58:15,419 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 16:58:15,425 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2021-12-15 16:58:15,426 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 16:58:15,426 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_5 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_5 >= 0] [2021-12-15 16:58:15,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-12-15 16:58:15,544 INFO L297 tatePredicateManager]: 41 out of 43 supporting invariants were superfluous and have been removed [2021-12-15 16:58:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:15,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 16:58:15,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:15,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-15 16:58:15,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 16:58:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:15,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 16:58:15,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:15,704 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 16:58:15,704 INFO L388 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 26 treesize of output 29 [2021-12-15 16:58:15,774 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 16:58:15,775 INFO L388 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 38 treesize of output 41 [2021-12-15 16:58:15,830 INFO L354 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2021-12-15 16:58:15,831 INFO L388 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 41 treesize of output 37 [2021-12-15 16:58:15,880 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-15 16:58:15,880 INFO L388 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 21 treesize of output 30 [2021-12-15 16:58:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:15,907 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2021-12-15 16:58:15,907 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 36 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-15 16:58:15,923 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 36 transitions. cyclomatic complexity: 5. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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) Result 33 states and 36 transitions. Complement of second has 4 states. [2021-12-15 16:58:15,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-15 16:58:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-15 16:58:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2021-12-15 16:58:15,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 10 letters. Loop has 8 letters. [2021-12-15 16:58:15,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:15,924 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 16:58:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:15,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 16:58:15,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:15,973 INFO L388 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 44 treesize of output 42 [2021-12-15 16:58:16,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 16:58:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:16,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 16:58:16,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:16,060 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 16:58:16,061 INFO L388 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 26 treesize of output 29 [2021-12-15 16:58:16,133 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 16:58:16,133 INFO L388 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 38 treesize of output 41 [2021-12-15 16:58:16,201 INFO L354 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2021-12-15 16:58:16,201 INFO L388 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 41 treesize of output 37 [2021-12-15 16:58:16,251 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-15 16:58:16,252 INFO L388 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 21 treesize of output 30 [2021-12-15 16:58:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:16,282 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 5 loop predicates [2021-12-15 16:58:16,282 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 36 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-15 16:58:16,296 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 36 transitions. cyclomatic complexity: 5. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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) Result 33 states and 36 transitions. Complement of second has 4 states. [2021-12-15 16:58:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2021-12-15 16:58:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-15 16:58:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2021-12-15 16:58:16,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 10 letters. Loop has 8 letters. [2021-12-15 16:58:16,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:16,299 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 16:58:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:16,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 16:58:16,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:16,348 INFO L388 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 98 treesize of output 94 [2021-12-15 16:58:16,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 16:58:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:16,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 16:58:16,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:16,435 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 16:58:16,436 INFO L388 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 26 treesize of output 29 [2021-12-15 16:58:16,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:16,523 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 16:58:16,523 INFO L388 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 38 treesize of output 41 [2021-12-15 16:58:16,598 INFO L354 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2021-12-15 16:58:16,599 INFO L388 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 41 treesize of output 37 [2021-12-15 16:58:16,645 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-15 16:58:16,646 INFO L388 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 21 treesize of output 30 [2021-12-15 16:58:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:16,665 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2021-12-15 16:58:16,666 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 36 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-15 16:58:16,743 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 36 transitions. cyclomatic complexity: 5. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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) Result 65 states and 70 transitions. Complement of second has 22 states. [2021-12-15 16:58:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-15 16:58:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-15 16:58:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2021-12-15 16:58:16,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 10 letters. Loop has 8 letters. [2021-12-15 16:58:16,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:16,745 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 16:58:16,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:16,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 16:58:16,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:16,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-15 16:58:16,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 16:58:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:16,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 16:58:16,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:16,875 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 16:58:16,875 INFO L388 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 26 treesize of output 29 [2021-12-15 16:58:16,944 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 16:58:16,944 INFO L388 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 38 treesize of output 41 [2021-12-15 16:58:17,005 INFO L354 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2021-12-15 16:58:17,006 INFO L388 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 41 treesize of output 37 [2021-12-15 16:58:17,075 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-15 16:58:17,076 INFO L388 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 21 treesize of output 30 [2021-12-15 16:58:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:17,117 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.3 stem predicates 5 loop predicates [2021-12-15 16:58:17,117 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 36 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-15 16:58:17,152 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 36 transitions. cyclomatic complexity: 5. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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) Result 38 states and 41 transitions. Complement of second has 5 states. [2021-12-15 16:58:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 0 non-accepting loop states 2 accepting loop states [2021-12-15 16:58:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-15 16:58:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2021-12-15 16:58:17,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2021-12-15 16:58:17,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:17,153 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 16:58:17,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:17,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 16:58:17,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:17,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-15 16:58:17,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 16:58:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:17,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 16:58:17,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:17,277 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 16:58:17,278 INFO L388 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 26 treesize of output 29 [2021-12-15 16:58:17,351 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 16:58:17,351 INFO L388 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 38 treesize of output 41 [2021-12-15 16:58:17,417 INFO L354 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2021-12-15 16:58:17,418 INFO L388 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 41 treesize of output 37 [2021-12-15 16:58:17,480 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-15 16:58:17,480 INFO L388 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 21 treesize of output 30 [2021-12-15 16:58:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:17,498 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2021-12-15 16:58:17,499 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 36 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-15 16:58:17,595 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 36 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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) Result 242 states and 299 transitions. Complement of second has 50 states 11 powerset states39 rank states. The highest rank that occured is 5 [2021-12-15 16:58:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-15 16:58:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-15 16:58:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2021-12-15 16:58:17,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 10 letters. Loop has 8 letters. [2021-12-15 16:58:17,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:17,599 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 16:58:17,599 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 16:58:17,601 INFO L158 Benchmark]: Toolchain (without parser) took 42305.43ms. Allocated memory was 96.5MB in the beginning and 339.7MB in the end (delta: 243.3MB). Free memory was 66.7MB in the beginning and 156.4MB in the end (delta: -89.7MB). Peak memory consumption was 153.5MB. Max. memory is 16.1GB. [2021-12-15 16:58:17,601 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 52.5MB in the beginning and 52.5MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 16:58:17,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.43ms. Allocated memory is still 96.5MB. Free memory was 66.5MB in the beginning and 73.7MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 16:58:17,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.40ms. Allocated memory is still 96.5MB. Free memory was 73.7MB in the beginning and 72.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 16:58:17,602 INFO L158 Benchmark]: Boogie Preprocessor took 19.56ms. Allocated memory is still 96.5MB. Free memory was 72.3MB in the beginning and 71.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 16:58:17,602 INFO L158 Benchmark]: RCFGBuilder took 295.29ms. Allocated memory is still 96.5MB. Free memory was 71.2MB in the beginning and 60.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 16:58:17,602 INFO L158 Benchmark]: BuchiAutomizer took 41780.68ms. Allocated memory was 96.5MB in the beginning and 339.7MB in the end (delta: 243.3MB). Free memory was 60.1MB in the beginning and 156.4MB in the end (delta: -96.2MB). Peak memory consumption was 150.1MB. Max. memory is 16.1GB. [2021-12-15 16:58:17,603 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 52.5MB in the beginning and 52.5MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.43ms. Allocated memory is still 96.5MB. Free memory was 66.5MB in the beginning and 73.7MB in the end (delta: -7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.40ms. Allocated memory is still 96.5MB. Free memory was 73.7MB in the beginning and 72.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.56ms. Allocated memory is still 96.5MB. Free memory was 72.3MB in the beginning and 71.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 295.29ms. Allocated memory is still 96.5MB. Free memory was 71.2MB in the beginning and 60.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 41780.68ms. Allocated memory was 96.5MB in the beginning and 339.7MB in the end (delta: 243.3MB). Free memory was 60.1MB in the beginning and 156.4MB in the end (delta: -96.2MB). Peak memory consumption was 150.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 16:58:17,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2021-12-15 16:58:17,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2021-12-15 16:58:18,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-12-15 16:58:18,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-15 16:58:18,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no settings was sufficient