./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d0878af360c86b536b5b3bc8d222f1c5ce26337b4ad6227d126c258cfe065cc9 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 17:30:43,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 17:30:43,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 17:30:43,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 17:30:43,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 17:30:43,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 17:30:43,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 17:30:43,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 17:30:43,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 17:30:43,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 17:30:43,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 17:30:43,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 17:30:43,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 17:30:43,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 17:30:43,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 17:30:43,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 17:30:43,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 17:30:43,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 17:30:43,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 17:30:43,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 17:30:43,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 17:30:43,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 17:30:43,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 17:30:43,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 17:30:43,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 17:30:43,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 17:30:43,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 17:30:43,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 17:30:43,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 17:30:43,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 17:30:43,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 17:30:43,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 17:30:43,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 17:30:43,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 17:30:43,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 17:30:43,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 17:30:43,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 17:30:43,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 17:30:43,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 17:30:43,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 17:30:43,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 17:30:43,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-19 17:30:43,116 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 17:30:43,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 17:30:43,117 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 17:30:43,117 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 17:30:43,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 17:30:43,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 17:30:43,118 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 17:30:43,119 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 17:30:43,119 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 17:30:43,119 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 17:30:43,119 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 17:30:43,120 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 17:30:43,120 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 17:30:43,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 17:30:43,120 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 17:30:43,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 17:30:43,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 17:30:43,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 17:30:43,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 17:30:43,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 17:30:43,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 17:30:43,121 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 17:30:43,121 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 17:30:43,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 17:30:43,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 17:30:43,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 17:30:43,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 17:30:43,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 17:30:43,122 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 17:30:43,122 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 17:30:43,122 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0878af360c86b536b5b3bc8d222f1c5ce26337b4ad6227d126c258cfe065cc9 [2021-12-19 17:30:43,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 17:30:43,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 17:30:43,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 17:30:43,337 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 17:30:43,337 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 17:30:43,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i [2021-12-19 17:30:43,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25183744/edf952dc058e4bd188a9311a49d7aefb/FLAG6cc450bc9 [2021-12-19 17:30:43,744 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 17:30:43,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i [2021-12-19 17:30:43,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25183744/edf952dc058e4bd188a9311a49d7aefb/FLAG6cc450bc9 [2021-12-19 17:30:44,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25183744/edf952dc058e4bd188a9311a49d7aefb [2021-12-19 17:30:44,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 17:30:44,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 17:30:44,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 17:30:44,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 17:30:44,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 17:30:44,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@141b5548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44, skipping insertion in model container [2021-12-19 17:30:44,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 17:30:44,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 17:30:44,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:30:44,464 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 17:30:44,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:30:44,520 INFO L208 MainTranslator]: Completed translation [2021-12-19 17:30:44,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44 WrapperNode [2021-12-19 17:30:44,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 17:30:44,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 17:30:44,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 17:30:44,522 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 17:30:44,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,558 INFO L137 Inliner]: procedures = 110, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2021-12-19 17:30:44,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 17:30:44,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 17:30:44,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 17:30:44,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 17:30:44,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 17:30:44,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 17:30:44,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 17:30:44,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 17:30:44,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44" (1/1) ... [2021-12-19 17:30:44,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:44,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:44,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:44,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-19 17:30:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-19 17:30:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-19 17:30:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 17:30:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 17:30:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 17:30:44,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 17:30:44,719 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 17:30:44,721 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 17:30:44,803 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 17:30:44,807 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 17:30:44,807 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-19 17:30:44,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:30:44 BoogieIcfgContainer [2021-12-19 17:30:44,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 17:30:44,809 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 17:30:44,809 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 17:30:44,811 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 17:30:44,811 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:30:44,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 05:30:44" (1/3) ... [2021-12-19 17:30:44,812 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e6f9256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:30:44, skipping insertion in model container [2021-12-19 17:30:44,812 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:30:44,812 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:44" (2/3) ... [2021-12-19 17:30:44,813 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e6f9256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:30:44, skipping insertion in model container [2021-12-19 17:30:44,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:30:44,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:30:44" (3/3) ... [2021-12-19 17:30:44,814 INFO L388 chiAutomizerObserver]: Analyzing ICFG GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i [2021-12-19 17:30:44,839 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 17:30:44,839 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 17:30:44,839 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 17:30:44,839 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 17:30:44,839 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 17:30:44,839 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 17:30:44,839 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 17:30:44,840 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 17:30:44,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:44,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:30:44,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:30:44,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:30:44,867 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:30:44,870 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:30:44,870 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 17:30:44,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:44,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:30:44,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:30:44,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:30:44,872 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:30:44,872 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:30:44,876 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 13#L552true assume !main_#t~short9#1; 3#L552-2true assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 9#L556-2true [2021-12-19 17:30:44,877 INFO L793 eck$LassoCheckResult]: Loop: 9#L556-2true call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 12#L555-1true assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 8#L556true assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 9#L556-2true [2021-12-19 17:30:44,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash 925671, now seen corresponding path program 1 times [2021-12-19 17:30:44,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:44,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810371978] [2021-12-19 17:30:44,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:44,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:30:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:30:44,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:30:44,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810371978] [2021-12-19 17:30:45,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810371978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:30:45,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:30:45,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 17:30:45,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297994949] [2021-12-19 17:30:45,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:30:45,004 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:30:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:45,005 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 1 times [2021-12-19 17:30:45,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:45,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933914155] [2021-12-19 17:30:45,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:45,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:45,021 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:30:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:45,043 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:30:45,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:30:45,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 17:30:45,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 17:30:45,196 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:30:45,213 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2021-12-19 17:30:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 17:30:45,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2021-12-19 17:30:45,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:30:45,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 8 transitions. [2021-12-19 17:30:45,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-19 17:30:45,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-19 17:30:45,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2021-12-19 17:30:45,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:30:45,221 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-12-19 17:30:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2021-12-19 17:30:45,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-12-19 17:30:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2021-12-19 17:30:45,236 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-12-19 17:30:45,236 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2021-12-19 17:30:45,236 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 17:30:45,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2021-12-19 17:30:45,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:30:45,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:30:45,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:30:45,237 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:30:45,237 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:30:45,238 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 40#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 34#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 35#L556-2 [2021-12-19 17:30:45,238 INFO L793 eck$LassoCheckResult]: Loop: 35#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 39#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 38#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 35#L556-2 [2021-12-19 17:30:45,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash 925609, now seen corresponding path program 1 times [2021-12-19 17:30:45,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:45,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375048298] [2021-12-19 17:30:45,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:45,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:45,264 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:30:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:45,282 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:30:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 2 times [2021-12-19 17:30:45,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:45,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139580223] [2021-12-19 17:30:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:45,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:45,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:30:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:45,297 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:30:45,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029994, now seen corresponding path program 1 times [2021-12-19 17:30:45,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:45,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044439880] [2021-12-19 17:30:45,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:45,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:45,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:30:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:45,350 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:30:46,000 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:30:46,001 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:30:46,001 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:30:46,001 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:30:46,001 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:30:46,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:46,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:30:46,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:30:46,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i_Iteration2_Lasso [2021-12-19 17:30:46,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:30:46,002 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:30:46,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:46,670 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:30:46,672 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:30:46,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:46,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:46,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:46,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-19 17:30:46,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:46,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:46,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:30:46,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:46,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:46,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:46,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:30:46,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:30:46,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:46,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:46,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:46,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:46,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:46,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-19 17:30:46,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:46,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:46,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:30:46,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:46,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:46,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:46,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:30:46,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:30:46,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:46,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:46,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:46,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:46,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:46,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-19 17:30:46,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:46,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:46,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:46,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:46,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:46,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:46,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:46,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:46,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:46,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:46,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:46,800 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:46,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-19 17:30:46,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:46,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:46,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:30:46,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:46,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:46,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:46,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:30:46,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:30:46,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:46,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:46,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:46,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:46,843 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:46,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-19 17:30:46,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:46,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:46,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:30:46,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:46,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:46,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:46,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:30:46,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:30:46,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:46,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:46,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:46,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:46,876 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:46,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-19 17:30:46,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:46,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:46,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:46,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:46,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:46,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:46,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:46,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:46,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:46,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:46,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:46,915 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:46,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:46,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:46,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:30:46,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:46,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:46,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:46,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:30:46,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:30:46,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-19 17:30:46,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:46,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:46,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:46,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:46,967 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:46,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-19 17:30:46,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:46,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:46,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:46,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:46,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:46,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:46,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:46,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:47,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:47,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:47,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:47,004 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:47,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-19 17:30:47,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:47,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:47,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:30:47,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:47,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:47,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:47,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:30:47,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:30:47,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:47,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:47,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:47,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:47,037 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:47,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-19 17:30:47,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:47,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:47,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:30:47,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:47,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:47,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:47,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:30:47,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:30:47,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:47,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:47,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:47,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:47,075 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:47,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-19 17:30:47,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:47,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:47,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:47,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:47,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:47,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:47,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:47,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:47,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:47,121 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:47,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:47,121 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:47,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-19 17:30:47,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-19 17:30:47,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:47,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:47,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:47,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:47,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:47,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:47,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:47,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-19 17:30:47,151 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:47,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:47,152 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:47,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-19 17:30:47,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:47,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:47,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:47,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:47,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:47,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:47,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:47,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:47,191 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-19 17:30:47,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:47,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:47,193 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:47,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-19 17:30:47,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:47,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:47,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:47,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:47,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:47,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:47,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:47,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:47,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:47,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:47,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:47,247 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:47,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-19 17:30:47,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-19 17:30:47,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:47,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:47,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:47,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:47,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:47,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:47,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:47,299 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-19 17:30:47,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:47,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:47,300 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:47,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-19 17:30:47,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:47,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:47,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:47,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:47,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:47,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:47,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:47,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:47,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:47,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:47,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:47,339 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:47,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-19 17:30:47,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:47,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:47,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:47,348 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 17:30:47,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:47,387 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-19 17:30:47,387 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-19 17:30:47,403 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:30:47,426 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-12-19 17:30:47,426 INFO L444 ModelExtractionUtils]: 7 out of 21 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-12-19 17:30:47,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:47,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:47,434 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:47,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-19 17:30:47,475 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:30:47,513 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2021-12-19 17:30:47,514 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:30:47,514 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1 + 3*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_1 >= 0] [2021-12-19 17:30:47,546 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-19 17:30:47,615 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2021-12-19 17:30:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:30:47,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-19 17:30:47,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:30:47,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 17:30:47,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 13 [2021-12-19 17:30:47,722 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-19 17:30:47,724 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 6 treesize of output 5 [2021-12-19 17:30:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:30:47,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-19 17:30:47,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:30:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:30:47,817 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2021-12-19 17:30:47,817 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:47,876 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 16 transitions. Complement of second has 8 states. [2021-12-19 17:30:47,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 17:30:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2021-12-19 17:30:47,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 4 letters. Loop has 3 letters. [2021-12-19 17:30:47,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:30:47,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 7 letters. Loop has 3 letters. [2021-12-19 17:30:47,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:30:47,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 4 letters. Loop has 6 letters. [2021-12-19 17:30:47,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:30:47,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2021-12-19 17:30:47,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:30:47,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2021-12-19 17:30:47,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-19 17:30:47,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-19 17:30:47,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2021-12-19 17:30:47,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:30:47,882 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-19 17:30:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2021-12-19 17:30:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-19 17:30:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2021-12-19 17:30:47,883 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-19 17:30:47,883 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2021-12-19 17:30:47,883 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 17:30:47,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2021-12-19 17:30:47,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:30:47,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:30:47,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:30:47,885 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:30:47,885 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:30:47,885 INFO L791 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 219#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 208#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 209#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 218#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 212#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 213#L556-2 [2021-12-19 17:30:47,885 INFO L793 eck$LassoCheckResult]: Loop: 213#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 216#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 220#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 213#L556-2 [2021-12-19 17:30:47,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:47,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029996, now seen corresponding path program 1 times [2021-12-19 17:30:47,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:47,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547956716] [2021-12-19 17:30:47,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:47,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:30:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:30:47,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:30:47,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547956716] [2021-12-19 17:30:47,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547956716] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:30:47,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:30:47,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 17:30:47,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657385388] [2021-12-19 17:30:47,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:30:47,993 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:30:47,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:47,993 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 3 times [2021-12-19 17:30:47,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:47,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028755567] [2021-12-19 17:30:47,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:47,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:47,998 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:30:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:48,002 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:30:48,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:30:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 17:30:48,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-19 17:30:48,073 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:30:48,109 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-12-19 17:30:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 17:30:48,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2021-12-19 17:30:48,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:30:48,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 17 transitions. [2021-12-19 17:30:48,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-19 17:30:48,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-19 17:30:48,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2021-12-19 17:30:48,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:30:48,111 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-19 17:30:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2021-12-19 17:30:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2021-12-19 17:30:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-19 17:30:48,112 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-19 17:30:48,112 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-19 17:30:48,112 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 17:30:48,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2021-12-19 17:30:48,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:30:48,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:30:48,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:30:48,113 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2021-12-19 17:30:48,113 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:30:48,113 INFO L791 eck$LassoCheckResult]: Stem: 253#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 254#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 261#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 251#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 252#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 259#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 257#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 258#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 260#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 255#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 256#L556-2 [2021-12-19 17:30:48,113 INFO L793 eck$LassoCheckResult]: Loop: 256#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 262#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 263#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 256#L556-2 [2021-12-19 17:30:48,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:48,113 INFO L85 PathProgramCache]: Analyzing trace with hash 658021387, now seen corresponding path program 1 times [2021-12-19 17:30:48,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:48,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529621306] [2021-12-19 17:30:48,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:48,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:48,132 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:30:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:48,147 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:30:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:48,147 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 4 times [2021-12-19 17:30:48,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:48,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152674551] [2021-12-19 17:30:48,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:48,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:48,151 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:30:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:48,155 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:30:48,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:48,155 INFO L85 PathProgramCache]: Analyzing trace with hash 884417224, now seen corresponding path program 2 times [2021-12-19 17:30:48,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:48,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552837450] [2021-12-19 17:30:48,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:48,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:48,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:48,207 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:30:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:48,238 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:30:49,231 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:30:49,231 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:30:49,231 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:30:49,231 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:30:49,232 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:30:49,232 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:49,232 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:30:49,232 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:30:49,232 INFO L133 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca.i_Iteration4_Lasso [2021-12-19 17:30:49,232 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:30:49,232 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:30:49,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:30:49,819 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:30:49,819 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:30:49,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:49,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:49,820 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:49,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-19 17:30:49,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:49,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:49,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:30:49,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:49,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:49,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:49,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:30:49,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:30:49,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:49,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:49,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:49,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:49,864 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:49,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:49,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:49,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:49,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:49,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:49,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:49,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:49,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-19 17:30:49,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:49,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:49,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:49,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:49,917 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:49,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-19 17:30:49,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:49,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:49,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:49,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:49,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:49,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:49,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:49,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:49,958 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-19 17:30:49,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:49,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:49,960 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:49,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-19 17:30:49,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-19 17:30:49,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:49,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:49,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:49,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:49,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:49,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:49,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:50,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:50,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:50,004 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:50,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:50,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:50,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:50,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:50,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:50,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:50,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:50,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-19 17:30:50,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:50,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:50,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:50,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:50,050 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:50,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-19 17:30:50,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:50,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:50,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:50,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:50,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:50,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:50,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:50,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:50,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-19 17:30:50,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:50,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:50,085 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:50,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-19 17:30:50,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:50,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:50,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:50,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:30:50,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:50,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 17:30:50,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 17:30:50,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:30:50,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-19 17:30:50,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:50,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:50,112 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:50,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-19 17:30:50,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:30:50,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:30:50,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:30:50,119 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-19 17:30:50,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:30:50,126 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-19 17:30:50,126 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-19 17:30:50,143 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:30:50,179 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-12-19 17:30:50,179 INFO L444 ModelExtractionUtils]: 6 out of 21 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-12-19 17:30:50,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:30:50,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:50,181 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:30:50,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-19 17:30:50,183 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:30:50,189 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2021-12-19 17:30:50,190 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:30:50,190 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2 + 1 Supporting invariants [] [2021-12-19 17:30:50,207 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-19 17:30:50,246 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2021-12-19 17:30:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:50,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-19 17:30:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:30:50,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 17:30:50,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:30:50,341 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:30:50,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:30:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:30:50,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 17:30:50,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:30:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:30:50,409 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-19 17:30:50,409 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:50,451 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 23 transitions. Complement of second has 9 states. [2021-12-19 17:30:50,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 17:30:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2021-12-19 17:30:50,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 10 letters. Loop has 3 letters. [2021-12-19 17:30:50,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:30:50,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2021-12-19 17:30:50,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:30:50,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 10 letters. Loop has 6 letters. [2021-12-19 17:30:50,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:30:50,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2021-12-19 17:30:50,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:30:50,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2021-12-19 17:30:50,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-19 17:30:50,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-12-19 17:30:50,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2021-12-19 17:30:50,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:30:50,454 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-19 17:30:50,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2021-12-19 17:30:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-19 17:30:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-19 17:30:50,455 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-19 17:30:50,455 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-19 17:30:50,455 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 17:30:50,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2021-12-19 17:30:50,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-19 17:30:50,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:30:50,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:30:50,456 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1] [2021-12-19 17:30:50,456 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:30:50,456 INFO L791 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 456#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 464#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 453#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 454#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 465#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 471#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 470#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 469#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 466#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 467#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 463#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 457#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 458#L556-2 [2021-12-19 17:30:50,456 INFO L793 eck$LassoCheckResult]: Loop: 458#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 461#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 468#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 458#L556-2 [2021-12-19 17:30:50,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash 884417226, now seen corresponding path program 3 times [2021-12-19 17:30:50,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:50,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694518824] [2021-12-19 17:30:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:50,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:30:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-19 17:30:50,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:30:50,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694518824] [2021-12-19 17:30:50,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694518824] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:30:50,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62833093] [2021-12-19 17:30:50,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:30:50,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:30:50,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:50,532 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:30:50,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-19 17:30:50,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-19 17:30:50,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:30:50,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-19 17:30:50,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:30:50,655 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-19 17:30:50,655 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 28 treesize of output 31 [2021-12-19 17:30:50,670 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:30:50,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:30:50,713 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 0 case distinctions, treesize of input 25 treesize of output 23 [2021-12-19 17:30:50,716 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 15 treesize of output 11 [2021-12-19 17:30:50,738 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 19 treesize of output 18 [2021-12-19 17:30:50,771 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 29 treesize of output 13 [2021-12-19 17:30:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:30:50,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:30:50,844 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 17:30:50,845 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 1 case distinctions, treesize of input 13 treesize of output 17 [2021-12-19 17:30:50,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_83| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_65| Int) (|ULTIMATE.start_main_~maxId~0#1.offset| Int) (v_ArrVal_206 Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_main_~tmp~0#1.offset_65|))) (or (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_83| (store (select |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_83|) |v_ULTIMATE.start_main_~tmp~0#1.offset_65| v_ArrVal_206)) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|) v_ArrVal_206) (<= .cse0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_83| v_arrayElimArr_2) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|)) (< 0 .cse0) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_83|))) (< v_ArrVal_206 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|) 1))))) is different from false [2021-12-19 17:30:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:30:51,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62833093] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:30:51,082 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:30:51,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2021-12-19 17:30:51,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099191382] [2021-12-19 17:30:51,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:30:51,082 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:30:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:51,083 INFO L85 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 5 times [2021-12-19 17:30:51,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:51,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640374078] [2021-12-19 17:30:51,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:51,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:51,086 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:30:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:30:51,089 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:30:51,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:30:51,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-19 17:30:51,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=252, Unknown=1, NotChecked=32, Total=342 [2021-12-19 17:30:51,163 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:30:51,336 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-12-19 17:30:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-19 17:30:51,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2021-12-19 17:30:51,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-19 17:30:51,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 30 states and 33 transitions. [2021-12-19 17:30:51,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-19 17:30:51,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-19 17:30:51,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2021-12-19 17:30:51,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:30:51,339 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-12-19 17:30:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2021-12-19 17:30:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2021-12-19 17:30:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:30:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2021-12-19 17:30:51,340 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2021-12-19 17:30:51,340 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2021-12-19 17:30:51,340 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 17:30:51,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2021-12-19 17:30:51,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-19 17:30:51,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:30:51,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:30:51,345 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1] [2021-12-19 17:30:51,345 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2021-12-19 17:30:51,345 INFO L791 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 621#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 629#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 618#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 619#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 638#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 639#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 637#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 636#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 635#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 633#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 634#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 624#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 625#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 628#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 632#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 645#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 643#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 622#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 623#L556-2 [2021-12-19 17:30:51,345 INFO L793 eck$LassoCheckResult]: Loop: 623#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 630#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 631#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 626#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 627#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 644#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 641#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 642#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 640#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 623#L556-2 [2021-12-19 17:30:51,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:30:51,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1816884246, now seen corresponding path program 4 times [2021-12-19 17:30:51,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:30:51,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402383593] [2021-12-19 17:30:51,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:30:51,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:30:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:30:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-19 17:30:51,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:30:51,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402383593] [2021-12-19 17:30:51,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402383593] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:30:51,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761850361] [2021-12-19 17:30:51,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 17:30:51,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:30:51,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:30:51,560 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:30:51,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-12-19 17:30:51,639 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 17:30:51,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:30:51,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-19 17:30:51,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:30:51,711 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-19 17:30:51,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-12-19 17:30:51,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2021-12-19 17:30:51,822 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-19 17:30:51,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2021-12-19 17:30:51,825 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 21 treesize of output 17 [2021-12-19 17:30:51,881 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-19 17:30:51,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2021-12-19 17:30:52,011 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-19 17:30:52,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 46 [2021-12-19 17:30:52,158 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-19 17:30:52,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 51 [2021-12-19 17:30:52,340 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-19 17:30:52,340 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 75 treesize of output 40 [2021-12-19 17:30:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:30:52,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:31:09,521 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 17:31:09,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 59 [2021-12-19 17:31:09,981 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_85| Int) (v_ArrVal_264 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~maxId~0#1.offset| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (let ((.cse0 (select v_arrayElimArr_4 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|)) (.cse1 (select v_arrayElimArr_5 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|)) (.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|)) (.cse3 (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| v_arrayElimArr_3))) (or (= .cse0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| v_arrayElimArr_4) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| (store (select |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85|) |v_ULTIMATE.start_main_~tmp~0#1.offset_68| v_ArrVal_264)) |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|) v_ArrVal_264) (< 0 .cse0) (< (+ .cse1 1) .cse2) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_85|))) (<= .cse2 (select (select .cse3 |c_ULTIMATE.start_main_~maxId~0#1.base|) |ULTIMATE.start_main_~maxId~0#1.offset|)) (= .cse1 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc10#1.base_85| v_arrayElimArr_5) |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|)) (< v_ArrVal_264 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|) 1)) (< (+ .cse0 1) .cse1) (= .cse2 (select (select .cse3 |c_ULTIMATE.start_main_~id~0#1.base|) |c_ULTIMATE.start_main_~id~0#1.offset|))))) is different from false [2021-12-19 17:31:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:31:10,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761850361] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:31:10,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:31:10,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 39 [2021-12-19 17:31:10,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128374223] [2021-12-19 17:31:10,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:31:10,252 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:31:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:31:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash -803259212, now seen corresponding path program 1 times [2021-12-19 17:31:10,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:31:10,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147256646] [2021-12-19 17:31:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:31:10,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:31:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:31:10,260 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:31:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:31:10,266 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:31:10,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:31:10,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-19 17:31:10,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1212, Unknown=12, NotChecked=74, Total=1560 [2021-12-19 17:31:10,564 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 6 Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:31:23,892 WARN L227 SmtUtils]: Spent 12.34s on a formula simplification. DAG size of input: 72 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-19 17:31:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:31:36,837 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2021-12-19 17:31:36,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-19 17:31:36,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 75 transitions. [2021-12-19 17:31:36,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-19 17:31:36,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 62 states and 67 transitions. [2021-12-19 17:31:36,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-19 17:31:36,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-19 17:31:36,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 67 transitions. [2021-12-19 17:31:36,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:31:36,840 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 67 transitions. [2021-12-19 17:31:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 67 transitions. [2021-12-19 17:31:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2021-12-19 17:31:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:31:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-12-19 17:31:36,842 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-19 17:31:36,842 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-19 17:31:36,842 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 17:31:36,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 50 transitions. [2021-12-19 17:31:36,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-19 17:31:36,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:31:36,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:31:36,844 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 5, 2, 1, 1, 1, 1] [2021-12-19 17:31:36,844 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2021-12-19 17:31:36,844 INFO L791 eck$LassoCheckResult]: Stem: 924#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 925#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 933#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 922#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 923#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 930#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 967#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 966#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 932#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 928#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 929#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 931#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 934#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 958#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 957#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 956#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 955#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 954#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 953#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 952#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 950#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 951#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 949#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 948#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 947#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 939#L556-2 [2021-12-19 17:31:36,844 INFO L793 eck$LassoCheckResult]: Loop: 939#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 945#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 935#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 936#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 946#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 944#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 943#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 942#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 941#L556 assume main_#t~mem15#1 <= main_#t~mem16#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;call main_#t~mem17#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int(1 + main_#t~mem17#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem17#1; 938#L556-2 call main_#t~mem12#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~id~0#1.base, main_~id~0#1.offset, 4); 940#L555-1 assume !!(main_#t~mem12#1 != main_#t~mem13#1 && 0 != main_#t~nondet14#1);havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem16#1 := read~int(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 937#L556 assume !(main_#t~mem15#1 <= main_#t~mem16#1);havoc main_#t~mem15#1;havoc main_#t~mem16#1;call write~int(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 939#L556-2 [2021-12-19 17:31:36,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:31:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash 636022350, now seen corresponding path program 5 times [2021-12-19 17:31:36,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:31:36,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795619643] [2021-12-19 17:31:36,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:31:36,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:31:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:31:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:31:37,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:31:37,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795619643] [2021-12-19 17:31:37,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795619643] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:31:37,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245790210] [2021-12-19 17:31:37,177 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 17:31:37,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:31:37,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:31:37,179 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:31:37,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-12-19 17:31:37,264 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-12-19 17:31:37,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:31:37,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-19 17:31:37,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:31:37,297 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-19 17:31:37,298 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-19 17:31:37,321 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-19 17:31:37,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-19 17:31:37,326 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 8 treesize of output 7 [2021-12-19 17:31:37,330 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 12 treesize of output 11 [2021-12-19 17:31:37,344 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 11 treesize of output 7 [2021-12-19 17:31:37,351 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 19 treesize of output 15 [2021-12-19 17:31:37,354 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 9 treesize of output 7 [2021-12-19 17:31:37,408 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 17:31:37,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-19 17:31:37,422 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-12-19 17:31:37,422 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 25 treesize of output 24 [2021-12-19 17:31:37,506 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-19 17:31:37,506 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 42 treesize of output 41 [2021-12-19 17:31:37,653 INFO L354 Elim1Store]: treesize reduction 26, result has 43.5 percent of original size [2021-12-19 17:31:37,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 51 [2021-12-19 17:31:37,865 INFO L354 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2021-12-19 17:31:37,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 39 [2021-12-19 17:31:38,023 INFO L354 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2021-12-19 17:31:38,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 43 [2021-12-19 17:31:38,226 INFO L354 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2021-12-19 17:31:38,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 49 [2021-12-19 17:31:38,448 INFO L354 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2021-12-19 17:31:38,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 55 [2021-12-19 17:31:38,614 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-19 17:31:38,617 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 96 treesize of output 49 [2021-12-19 17:31:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:31:38,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:35:58,452 WARN L227 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-19 17:36:10,775 WARN L227 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-19 17:36:23,272 WARN L227 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-19 17:36:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:36:24,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245790210] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:36:24,226 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:36:24,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 21] total 54 [2021-12-19 17:36:24,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057999779] [2021-12-19 17:36:24,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:36:24,228 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:36:24,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:36:24,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1662545091, now seen corresponding path program 2 times [2021-12-19 17:36:24,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:36:24,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732817682] [2021-12-19 17:36:24,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:36:24,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:36:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:36:24,261 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:36:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:36:24,273 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:36:25,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:36:25,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-19 17:36:25,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=2443, Unknown=17, NotChecked=0, Total=2970 [2021-12-19 17:36:25,071 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. cyclomatic complexity: 7 Second operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 55 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:36:37,709 WARN L227 SmtUtils]: Spent 12.18s on a formula simplification. DAG size of input: 80 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15