./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/max.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 20:23:30,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 20:23:30,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 20:23:30,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 20:23:30,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 20:23:30,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 20:23:30,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 20:23:30,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 20:23:30,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 20:23:30,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 20:23:30,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 20:23:30,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 20:23:30,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 20:23:30,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 20:23:30,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 20:23:30,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 20:23:30,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 20:23:30,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 20:23:30,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 20:23:30,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 20:23:30,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 20:23:30,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 20:23:30,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 20:23:30,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 20:23:30,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 20:23:30,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 20:23:30,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 20:23:30,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 20:23:30,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 20:23:30,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 20:23:30,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 20:23:30,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 20:23:30,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 20:23:30,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 20:23:30,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 20:23:30,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 20:23:30,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 20:23:30,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 20:23:30,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 20:23:30,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 20:23:30,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 20:23:30,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-19 20:23:30,198 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 20:23:30,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 20:23:30,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 20:23:30,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 20:23:30,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 20:23:30,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 20:23:30,200 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 20:23:30,200 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 20:23:30,200 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 20:23:30,200 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 20:23:30,201 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 20:23:30,201 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 20:23:30,201 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 20:23:30,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 20:23:30,201 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 20:23:30,201 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 20:23:30,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 20:23:30,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 20:23:30,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 20:23:30,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 20:23:30,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 20:23:30,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 20:23:30,202 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 20:23:30,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 20:23:30,203 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 20:23:30,203 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 20:23:30,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 20:23:30,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 20:23:30,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 20:23:30,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 20:23:30,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 20:23:30,204 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 20:23:30,204 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 20:23:30,205 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e [2021-12-19 20:23:30,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 20:23:30,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 20:23:30,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 20:23:30,379 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 20:23:30,383 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 20:23:30,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max.i [2021-12-19 20:23:30,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9013a0aa9/cd1cb234fb124d48b3fd5023e9b7cfed/FLAG9c8794f6d [2021-12-19 20:23:30,809 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 20:23:30,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i [2021-12-19 20:23:30,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9013a0aa9/cd1cb234fb124d48b3fd5023e9b7cfed/FLAG9c8794f6d [2021-12-19 20:23:31,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9013a0aa9/cd1cb234fb124d48b3fd5023e9b7cfed [2021-12-19 20:23:31,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 20:23:31,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 20:23:31,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 20:23:31,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 20:23:31,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 20:23:31,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d4eeb50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31, skipping insertion in model container [2021-12-19 20:23:31,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 20:23:31,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 20:23:31,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i[1295,1308] [2021-12-19 20:23:31,381 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 20:23:31,388 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 20:23:31,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i[1295,1308] [2021-12-19 20:23:31,415 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 20:23:31,425 INFO L208 MainTranslator]: Completed translation [2021-12-19 20:23:31,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31 WrapperNode [2021-12-19 20:23:31,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 20:23:31,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 20:23:31,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 20:23:31,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 20:23:31,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,460 INFO L137 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2021-12-19 20:23:31,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 20:23:31,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 20:23:31,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 20:23:31,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 20:23:31,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 20:23:31,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 20:23:31,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 20:23:31,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 20:23:31,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31" (1/1) ... [2021-12-19 20:23:31,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:31,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:31,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:31,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-19 20:23:31,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 20:23:31,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-19 20:23:31,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 20:23:31,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-19 20:23:31,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 20:23:31,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 20:23:31,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-19 20:23:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 20:23:31,683 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 20:23:31,684 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 20:23:31,809 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 20:23:31,814 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 20:23:31,814 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-19 20:23:31,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:23:31 BoogieIcfgContainer [2021-12-19 20:23:31,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 20:23:31,817 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 20:23:31,817 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 20:23:31,820 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 20:23:31,821 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:23:31,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 08:23:31" (1/3) ... [2021-12-19 20:23:31,822 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5356d1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 08:23:31, skipping insertion in model container [2021-12-19 20:23:31,822 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:23:31,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:23:31" (2/3) ... [2021-12-19 20:23:31,823 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5356d1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 08:23:31, skipping insertion in model container [2021-12-19 20:23:31,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:23:31,823 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:23:31" (3/3) ... [2021-12-19 20:23:31,824 INFO L388 chiAutomizerObserver]: Analyzing ICFG max.i [2021-12-19 20:23:31,873 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 20:23:31,874 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 20:23:31,874 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 20:23:31,874 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 20:23:31,874 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 20:23:31,874 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 20:23:31,874 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 20:23:31,875 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 20:23:31,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:31,910 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-12-19 20:23:31,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:31,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:31,915 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-19 20:23:31,916 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:23:31,916 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 20:23:31,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:31,924 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-12-19 20:23:31,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:31,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:31,925 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-19 20:23:31,925 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:23:31,936 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 9#L31true assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 16#L22-3true [2021-12-19 20:23:31,936 INFO L793 eck$LassoCheckResult]: Loop: 16#L22-3true assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 14#L23true assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 28#L23-2true max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 11#L22-2true max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 16#L22-3true [2021-12-19 20:23:31,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-19 20:23:31,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:31,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176817332] [2021-12-19 20:23:31,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:31,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:32,009 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:32,034 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:32,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1326822, now seen corresponding path program 1 times [2021-12-19 20:23:32,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:32,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043740621] [2021-12-19 20:23:32,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:32,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:32,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:32,070 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:32,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1805089543, now seen corresponding path program 1 times [2021-12-19 20:23:32,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:32,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369045889] [2021-12-19 20:23:32,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:32,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:32,092 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:32,104 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:32,516 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:23:32,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:23:32,517 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:23:32,517 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:23:32,517 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:23:32,517 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:32,517 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:23:32,517 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:23:32,518 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration1_Lasso [2021-12-19 20:23:32,518 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:23:32,518 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:23:32,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:32,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:33,038 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:23:33,041 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:23:33,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:33,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:33,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:33,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:33,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:33,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:23:33,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:33,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:33,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:33,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:23:33,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:23:33,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-19 20:23:33,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:33,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:33,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:33,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:33,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:33,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-19 20:23:33,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:33,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:33,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:23:33,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:33,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:33,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:33,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:23:33,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:23:33,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:33,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:33,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:33,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:33,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:33,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-19 20:23:33,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:33,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:33,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:23:33,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:33,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:33,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:33,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:23:33,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:23:33,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:33,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:33,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:33,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:33,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:33,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-19 20:23:33,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:33,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:33,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:23:33,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:33,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:33,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:33,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:23:33,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:23:33,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:33,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:33,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:33,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:33,216 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:33,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-19 20:23:33,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:33,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:33,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:33,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:33,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:33,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:33,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:33,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:33,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:33,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:33,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:33,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:33,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-19 20:23:33,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:33,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:33,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:33,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:33,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:33,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:33,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:33,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:33,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:33,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:33,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:33,301 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:33,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-19 20:23:33,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:33,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:33,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:33,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:33,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:33,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:33,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:33,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:33,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:33,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:33,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:33,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:33,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-19 20:23:33,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:33,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:33,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:33,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:33,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:33,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:33,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:33,374 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:23:33,407 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-19 20:23:33,408 INFO L444 ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-19 20:23:33,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:33,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:33,412 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:33,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-19 20:23:33,414 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:23:33,435 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:23:33,435 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:23:33,435 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1, ~N~0) = -1*ULTIMATE.start_max_~i~0#1 + 1*~N~0 Supporting invariants [] [2021-12-19 20:23:33,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-12-19 20:23:33,468 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-12-19 20:23:33,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:33,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 20:23:33,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:33,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:23:33,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:33,549 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-19 20:23:33,550 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 20:23:33,578 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 63 states and 87 transitions. Complement of second has 8 states. [2021-12-19 20:23:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 20:23:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 20:23:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2021-12-19 20:23:33,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 4 letters. [2021-12-19 20:23:33,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:33,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 7 letters. Loop has 4 letters. [2021-12-19 20:23:33,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:33,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 8 letters. [2021-12-19 20:23:33,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:33,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 87 transitions. [2021-12-19 20:23:33,587 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-19 20:23:33,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 32 transitions. [2021-12-19 20:23:33,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-19 20:23:33,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-19 20:23:33,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2021-12-19 20:23:33,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:33,591 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2021-12-19 20:23:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2021-12-19 20:23:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-19 20:23:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2021-12-19 20:23:33,605 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2021-12-19 20:23:33,605 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2021-12-19 20:23:33,606 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 20:23:33,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2021-12-19 20:23:33,606 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-19 20:23:33,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:33,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:33,607 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 20:23:33,607 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:23:33,607 INFO L791 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 191#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 202#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 203#L22-3 assume !(max_~i~0#1 < ~N~0); 204#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 197#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 198#L22-8 [2021-12-19 20:23:33,607 INFO L793 eck$LassoCheckResult]: Loop: 198#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 200#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 188#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 189#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 198#L22-8 [2021-12-19 20:23:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash 889511083, now seen corresponding path program 1 times [2021-12-19 20:23:33,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:33,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272576636] [2021-12-19 20:23:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:33,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:33,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:23:33,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272576636] [2021-12-19 20:23:33,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272576636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:23:33,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 20:23:33,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 20:23:33,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923496905] [2021-12-19 20:23:33,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:23:33,657 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:23:33,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:33,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 1 times [2021-12-19 20:23:33,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:33,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44981612] [2021-12-19 20:23:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:33,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:33,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:33,665 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:33,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:23:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 20:23:33,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 20:23:33,705 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:23:33,726 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2021-12-19 20:23:33,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 20:23:33,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2021-12-19 20:23:33,728 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-19 20:23:33,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2021-12-19 20:23:33,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-19 20:23:33,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-19 20:23:33,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2021-12-19 20:23:33,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:33,729 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-12-19 20:23:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2021-12-19 20:23:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2021-12-19 20:23:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2021-12-19 20:23:33,730 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2021-12-19 20:23:33,730 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2021-12-19 20:23:33,731 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 20:23:33,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2021-12-19 20:23:33,731 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-19 20:23:33,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:33,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:33,732 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:33,732 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:23:33,732 INFO L791 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 257#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 258#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 263#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 262#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 260#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 261#L22-3 assume !(max_~i~0#1 < ~N~0); 259#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 252#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 253#L22-8 [2021-12-19 20:23:33,732 INFO L793 eck$LassoCheckResult]: Loop: 253#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 255#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 241#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 242#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 253#L22-8 [2021-12-19 20:23:33,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:33,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1805667996, now seen corresponding path program 1 times [2021-12-19 20:23:33,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:33,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842935783] [2021-12-19 20:23:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:33,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:33,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:23:33,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842935783] [2021-12-19 20:23:33,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842935783] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:23:33,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181917686] [2021-12-19 20:23:33,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:33,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:23:33,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:33,794 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:23:33,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:33,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-19 20:23:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:33,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:23:33,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:33,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:23:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:33,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181917686] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:23:33,955 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:23:33,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-19 20:23:33,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30881983] [2021-12-19 20:23:33,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:23:33,956 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:23:33,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 2 times [2021-12-19 20:23:33,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:33,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837793731] [2021-12-19 20:23:33,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:33,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:33,963 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:33,970 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:34,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:23:34,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 20:23:34,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-12-19 20:23:34,019 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:23:34,077 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2021-12-19 20:23:34,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 20:23:34,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2021-12-19 20:23:34,079 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-19 20:23:34,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2021-12-19 20:23:34,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-19 20:23:34,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-19 20:23:34,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2021-12-19 20:23:34,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:34,081 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-12-19 20:23:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2021-12-19 20:23:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-12-19 20:23:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-19 20:23:34,083 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-19 20:23:34,083 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-19 20:23:34,083 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 20:23:34,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2021-12-19 20:23:34,084 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-19 20:23:34,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:34,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:34,085 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:34,085 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:23:34,085 INFO L791 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 363#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 374#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 375#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 382#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 384#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 377#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 378#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 381#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 379#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 380#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 383#L22-3 assume !(max_~i~0#1 < ~N~0); 376#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 369#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 370#L22-8 [2021-12-19 20:23:34,086 INFO L793 eck$LassoCheckResult]: Loop: 370#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 372#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 358#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 359#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 370#L22-8 [2021-12-19 20:23:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:34,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1818198429, now seen corresponding path program 2 times [2021-12-19 20:23:34,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:34,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498413715] [2021-12-19 20:23:34,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:34,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:34,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:34,122 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:34,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:34,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 3 times [2021-12-19 20:23:34,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:34,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908116707] [2021-12-19 20:23:34,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:34,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:34,127 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:34,130 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:34,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1198284866, now seen corresponding path program 1 times [2021-12-19 20:23:34,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:34,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193697059] [2021-12-19 20:23:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:34,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:34,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:34,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:23:34,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193697059] [2021-12-19 20:23:34,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193697059] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:23:34,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439861457] [2021-12-19 20:23:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:34,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:23:34,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:34,346 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:23:34,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-19 20:23:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:34,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-19 20:23:34,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:34,634 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 29 treesize of output 21 [2021-12-19 20:23:34,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 20:23:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:34,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:23:34,841 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:23:34,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2021-12-19 20:23:34,857 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 3 [2021-12-19 20:23:34,872 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:23:34,872 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 40 treesize of output 44 [2021-12-19 20:23:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:35,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439861457] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:23:35,048 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:23:35,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2021-12-19 20:23:35,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819590778] [2021-12-19 20:23:35,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:23:35,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:23:35,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-19 20:23:35,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-12-19 20:23:35,091 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:35,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:23:35,749 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2021-12-19 20:23:35,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-19 20:23:35,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 124 transitions. [2021-12-19 20:23:35,751 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 20 [2021-12-19 20:23:35,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 124 transitions. [2021-12-19 20:23:35,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2021-12-19 20:23:35,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2021-12-19 20:23:35,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 124 transitions. [2021-12-19 20:23:35,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:35,754 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 124 transitions. [2021-12-19 20:23:35,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 124 transitions. [2021-12-19 20:23:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 38. [2021-12-19 20:23:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2021-12-19 20:23:35,759 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2021-12-19 20:23:35,759 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2021-12-19 20:23:35,759 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 20:23:35,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2021-12-19 20:23:35,760 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-19 20:23:35,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:35,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:35,761 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:35,761 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:23:35,761 INFO L791 eck$LassoCheckResult]: Stem: 634#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 635#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 646#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 647#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 653#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 654#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 667#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 666#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 659#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 662#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 663#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 657#L22-3 assume !(max_~i~0#1 < ~N~0); 658#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 641#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 642#L22-8 [2021-12-19 20:23:35,761 INFO L793 eck$LassoCheckResult]: Loop: 642#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 644#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 630#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 631#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 642#L22-8 [2021-12-19 20:23:35,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:35,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2083741857, now seen corresponding path program 1 times [2021-12-19 20:23:35,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:35,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242561933] [2021-12-19 20:23:35,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:35,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:35,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:35,786 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 4 times [2021-12-19 20:23:35,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:35,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800826576] [2021-12-19 20:23:35,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:35,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:35,789 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:35,792 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2085565180, now seen corresponding path program 1 times [2021-12-19 20:23:35,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:35,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028155828] [2021-12-19 20:23:35,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:35,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:35,804 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:35,825 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:36,424 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:23:36,424 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:23:36,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:23:36,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:23:36,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:23:36,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:36,425 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:23:36,425 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:23:36,425 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration5_Lasso [2021-12-19 20:23:36,425 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:23:36,425 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:23:36,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:36,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:36,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:37,776 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:23:37,776 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:23:37,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:37,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:37,823 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:37,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-19 20:23:37,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:37,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:37,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:23:37,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:37,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:37,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:37,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:23:37,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:23:37,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:37,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:37,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:37,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:37,854 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:37,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-19 20:23:37,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:37,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:37,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:23:37,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:37,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:37,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:37,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:23:37,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:23:37,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:37,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:37,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:37,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:37,896 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:37,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-19 20:23:37,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:37,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:37,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:37,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:37,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:37,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:37,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:37,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:37,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:37,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:37,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:37,951 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:37,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-19 20:23:37,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:37,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:37,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:37,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:37,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:37,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:37,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:37,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:37,992 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 20:23:37,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:37,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:37,993 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:37,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-19 20:23:37,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:38,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:38,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:38,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:38,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:38,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:38,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:38,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:38,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-19 20:23:38,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:38,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:38,031 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:38,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-19 20:23:38,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:38,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:38,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:38,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:38,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:38,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:38,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:38,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:38,075 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 20:23:38,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:38,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:38,092 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:38,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-19 20:23:38,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:38,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:38,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:38,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:38,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:38,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:38,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:38,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:38,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:38,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:38,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:38,130 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:38,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-19 20:23:38,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:38,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:38,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:38,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:38,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:38,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:38,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:38,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:38,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:38,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:38,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:38,161 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:38,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-19 20:23:38,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:38,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:38,171 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-19 20:23:38,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:38,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:38,178 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-19 20:23:38,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:38,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:38,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:38,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:38,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:38,232 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:38,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-19 20:23:38,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:38,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:38,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:38,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:38,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:38,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:38,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:38,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:23:38,279 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2021-12-19 20:23:38,279 INFO L444 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 17 variables to zero. [2021-12-19 20:23:38,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:38,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:38,280 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:38,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-19 20:23:38,284 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:23:38,301 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-19 20:23:38,301 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:23:38,301 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2) = -2*ULTIMATE.start_max_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2 Supporting invariants [1*v_rep(select #length ULTIMATE.start_max_~x#1.base)_2 - 2*~N~0 >= 0] [2021-12-19 20:23:38,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-19 20:23:38,371 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2021-12-19 20:23:38,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:38,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 20:23:38,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:38,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 20:23:38,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:38,594 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-19 20:23:38,594 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:38,742 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 20:23:38,791 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 14. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 65 transitions. Complement of second has 11 states. [2021-12-19 20:23:38,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 20:23:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2021-12-19 20:23:38,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-19 20:23:38,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:38,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 18 letters. Loop has 4 letters. [2021-12-19 20:23:38,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:38,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 14 letters. Loop has 8 letters. [2021-12-19 20:23:38,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:38,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. [2021-12-19 20:23:38,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-19 20:23:38,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 39 states and 50 transitions. [2021-12-19 20:23:38,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-19 20:23:38,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-19 20:23:38,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2021-12-19 20:23:38,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:38,801 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2021-12-19 20:23:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2021-12-19 20:23:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-12-19 20:23:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 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 20:23:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2021-12-19 20:23:38,804 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2021-12-19 20:23:38,804 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2021-12-19 20:23:38,804 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 20:23:38,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2021-12-19 20:23:38,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-19 20:23:38,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:38,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:38,805 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:38,805 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:23:38,806 INFO L791 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 921#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 934#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 935#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 940#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 939#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 937#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 938#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 942#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 948#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 947#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 946#L22-3 assume !(max_~i~0#1 < ~N~0); 945#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 944#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 943#L22-8 assume !(max_~i~0#1 < ~N~0); 931#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 930#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 926#L43-3 [2021-12-19 20:23:38,806 INFO L793 eck$LassoCheckResult]: Loop: 926#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 925#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 926#L43-3 [2021-12-19 20:23:38,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1591298555, now seen corresponding path program 1 times [2021-12-19 20:23:38,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:38,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728856113] [2021-12-19 20:23:38,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:38,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 20:23:38,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:23:38,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728856113] [2021-12-19 20:23:38,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728856113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:23:38,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 20:23:38,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 20:23:38,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790234601] [2021-12-19 20:23:38,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:23:38,832 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:23:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2021-12-19 20:23:38,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:38,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559531459] [2021-12-19 20:23:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:38,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:38,836 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:38,839 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:38,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:23:38,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 20:23:38,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 20:23:38,876 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:23:38,902 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2021-12-19 20:23:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 20:23:38,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2021-12-19 20:23:38,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-19 20:23:38,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 57 transitions. [2021-12-19 20:23:38,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-19 20:23:38,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-19 20:23:38,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 57 transitions. [2021-12-19 20:23:38,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:38,904 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2021-12-19 20:23:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 57 transitions. [2021-12-19 20:23:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2021-12-19 20:23:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2021-12-19 20:23:38,906 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-12-19 20:23:38,906 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-12-19 20:23:38,906 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 20:23:38,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2021-12-19 20:23:38,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-19 20:23:38,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:38,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:38,907 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:38,907 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:23:38,908 INFO L791 eck$LassoCheckResult]: Stem: 1012#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1013#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1026#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1027#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1032#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1033#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1046#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1045#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1038#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1043#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1041#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1036#L22-3 assume !(max_~i~0#1 < ~N~0); 1037#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1039#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1022#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1023#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1008#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1009#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1021#L22-8 assume !(max_~i~0#1 < ~N~0); 1024#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1025#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 1018#L43-3 [2021-12-19 20:23:38,908 INFO L793 eck$LassoCheckResult]: Loop: 1018#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 1017#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1018#L43-3 [2021-12-19 20:23:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash -18080898, now seen corresponding path program 1 times [2021-12-19 20:23:38,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:38,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356891986] [2021-12-19 20:23:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:38,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 20:23:38,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:23:38,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356891986] [2021-12-19 20:23:38,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356891986] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:23:38,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996175998] [2021-12-19 20:23:38,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:38,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:23:38,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:38,952 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:23:38,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-19 20:23:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:39,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:23:39,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 20:23:39,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:23:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 20:23:39,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996175998] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:23:39,089 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:23:39,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-19 20:23:39,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686626723] [2021-12-19 20:23:39,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:23:39,089 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:23:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:39,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2021-12-19 20:23:39,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:39,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75954973] [2021-12-19 20:23:39,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:39,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:39,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:39,096 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:39,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:23:39,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-19 20:23:39,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-12-19 20:23:39,137 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. cyclomatic complexity: 13 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:23:39,196 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2021-12-19 20:23:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 20:23:39,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 71 transitions. [2021-12-19 20:23:39,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-19 20:23:39,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 71 transitions. [2021-12-19 20:23:39,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-19 20:23:39,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-19 20:23:39,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 71 transitions. [2021-12-19 20:23:39,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:39,198 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2021-12-19 20:23:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 71 transitions. [2021-12-19 20:23:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2021-12-19 20:23:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2021-12-19 20:23:39,201 INFO L704 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2021-12-19 20:23:39,201 INFO L587 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2021-12-19 20:23:39,201 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-19 20:23:39,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 53 transitions. [2021-12-19 20:23:39,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-19 20:23:39,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:39,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:39,202 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:39,202 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:23:39,202 INFO L791 eck$LassoCheckResult]: Stem: 1241#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1242#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1255#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1256#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1264#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1261#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1258#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1259#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1262#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1263#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1274#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1272#L22-3 assume !(max_~i~0#1 < ~N~0); 1270#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1269#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1268#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1267#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1266#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1265#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1252#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1253#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1237#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1238#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1250#L22-8 assume !(max_~i~0#1 < ~N~0); 1260#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1254#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 1247#L43-3 [2021-12-19 20:23:39,203 INFO L793 eck$LassoCheckResult]: Loop: 1247#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 1246#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1247#L43-3 [2021-12-19 20:23:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2011161481, now seen corresponding path program 2 times [2021-12-19 20:23:39,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:39,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27393814] [2021-12-19 20:23:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:39,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:39,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:23:39,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27393814] [2021-12-19 20:23:39,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27393814] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:23:39,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583287721] [2021-12-19 20:23:39,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:23:39,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:23:39,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:39,499 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:23:39,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-19 20:23:39,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:23:39,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:23:39,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-19 20:23:39,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:39,642 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 29 treesize of output 21 [2021-12-19 20:23:39,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 20:23:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-19 20:23:39,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:23:39,865 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:23:39,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-19 20:23:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-19 20:23:39,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583287721] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:23:39,912 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:23:39,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2021-12-19 20:23:39,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684625238] [2021-12-19 20:23:39,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:23:39,912 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:23:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2021-12-19 20:23:39,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:39,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265955730] [2021-12-19 20:23:39,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:39,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:39,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:39,921 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:39,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:23:39,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-19 20:23:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2021-12-19 20:23:39,960 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. cyclomatic complexity: 14 Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:23:40,406 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2021-12-19 20:23:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-19 20:23:40,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 126 transitions. [2021-12-19 20:23:40,408 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2021-12-19 20:23:40,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 126 transitions. [2021-12-19 20:23:40,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2021-12-19 20:23:40,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2021-12-19 20:23:40,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 126 transitions. [2021-12-19 20:23:40,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:40,410 INFO L681 BuchiCegarLoop]: Abstraction has 103 states and 126 transitions. [2021-12-19 20:23:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 126 transitions. [2021-12-19 20:23:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 55. [2021-12-19 20:23:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2021-12-19 20:23:40,414 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 68 transitions. [2021-12-19 20:23:40,414 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 68 transitions. [2021-12-19 20:23:40,414 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-19 20:23:40,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 68 transitions. [2021-12-19 20:23:40,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-19 20:23:40,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:40,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:40,416 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:40,416 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:23:40,416 INFO L791 eck$LassoCheckResult]: Stem: 1576#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1577#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1589#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1590#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1599#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1595#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1596#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1600#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1597#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1598#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1606#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1605#L22-3 assume !(max_~i~0#1 < ~N~0); 1591#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1583#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1584#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1587#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1574#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1575#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1585#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1588#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1602#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1604#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1603#L22-8 assume !(max_~i~0#1 < ~N~0); 1594#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1586#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 1582#L43-3 [2021-12-19 20:23:40,416 INFO L793 eck$LassoCheckResult]: Loop: 1582#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 1581#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1582#L43-3 [2021-12-19 20:23:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1618134471, now seen corresponding path program 1 times [2021-12-19 20:23:40,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:40,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782600642] [2021-12-19 20:23:40,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:40,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:40,434 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:40,459 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:40,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:40,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2021-12-19 20:23:40,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:40,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341868687] [2021-12-19 20:23:40,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:40,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:40,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:40,465 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash -249063589, now seen corresponding path program 1 times [2021-12-19 20:23:40,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:40,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329409043] [2021-12-19 20:23:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:40,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:40,501 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:40,521 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:42,328 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:23:42,328 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:23:42,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:23:42,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:23:42,328 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:23:42,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:42,328 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:23:42,328 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:23:42,328 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration9_Lasso [2021-12-19 20:23:42,328 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:23:42,328 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:23:42,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:42,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:42,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:42,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:42,724 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2021-12-19 20:23:43,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:43,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:44,720 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:23:44,720 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:23:44,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:44,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:44,724 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:44,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-19 20:23:44,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:44,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:44,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:23:44,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:44,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:44,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:44,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:23:44,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:23:44,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:44,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:44,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:44,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:44,760 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:44,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-19 20:23:44,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:44,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:44,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:44,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:44,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:44,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:44,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:44,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:44,788 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 20:23:44,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:44,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:44,790 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:44,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-19 20:23:44,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:44,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:44,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:23:44,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:44,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:44,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:44,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:23:44,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:23:44,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:44,834 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 20:23:44,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:44,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:44,835 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:44,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-19 20:23:44,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:44,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:44,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:44,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:44,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:44,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:44,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:44,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:44,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:44,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:44,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:44,877 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:44,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-19 20:23:44,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:44,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:44,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:44,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:44,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:44,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:44,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:44,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:44,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:44,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:44,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:44,935 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:44,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-19 20:23:44,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:44,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:44,944 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-19 20:23:44,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:44,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:44,953 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-19 20:23:44,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:44,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:44,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-19 20:23:44,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:44,981 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:44,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-19 20:23:44,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:44,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:44,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:44,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:44,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:44,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:44,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:44,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,010 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-19 20:23:45,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:45,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,026 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,044 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-19 20:23:45,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 20:23:45,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,081 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-19 20:23:45,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:45,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,120 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-19 20:23:45,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:45,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,151 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-19 20:23:45,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 20:23:45,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,194 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-19 20:23:45,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:45,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,236 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-19 20:23:45,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:45,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,278 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-19 20:23:45,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:45,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,323 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-19 20:23:45,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:45,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-19 20:23:45,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,357 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-19 20:23:45,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:45,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-12-19 20:23:45,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,389 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-19 20:23:45,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:45,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,431 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-19 20:23:45,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:45,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:45,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,468 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-19 20:23:45,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:45,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:45,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:45,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:45,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:45,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:45,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:45,497 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:23:45,530 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2021-12-19 20:23:45,530 INFO L444 ModelExtractionUtils]: 7 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-12-19 20:23:45,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:45,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:45,531 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:45,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-19 20:23:45,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:23:45,543 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:23:45,543 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:23:45,543 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_3) = -4*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_3 Supporting invariants [] [2021-12-19 20:23:45,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,674 INFO L297 tatePredicateManager]: 45 out of 46 supporting invariants were superfluous and have been removed [2021-12-19 20:23:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:45,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:23:45,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:45,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:45,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 20:23:45,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:45,955 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-19 20:23:45,956 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 68 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:45,987 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 68 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 62 states and 80 transitions. Complement of second has 7 states. [2021-12-19 20:23:45,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 20:23:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2021-12-19 20:23:45,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 25 letters. Loop has 2 letters. [2021-12-19 20:23:45,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:45,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-19 20:23:45,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:45,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 25 letters. Loop has 4 letters. [2021-12-19 20:23:45,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:45,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 80 transitions. [2021-12-19 20:23:45,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:23:45,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 70 transitions. [2021-12-19 20:23:45,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-19 20:23:45,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-19 20:23:45,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 70 transitions. [2021-12-19 20:23:45,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:45,991 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-12-19 20:23:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 70 transitions. [2021-12-19 20:23:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-19 20:23:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.25) internal successors, (70), 55 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2021-12-19 20:23:45,993 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-12-19 20:23:45,993 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-12-19 20:23:45,993 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-19 20:23:45,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 70 transitions. [2021-12-19 20:23:45,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:23:45,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:45,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:45,994 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:45,994 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:23:45,995 INFO L791 eck$LassoCheckResult]: Stem: 1988#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1989#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2005#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2006#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2011#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2012#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2039#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2038#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2028#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2035#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2032#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2027#L22-3 assume !(max_~i~0#1 < ~N~0); 2025#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2023#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2022#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2020#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1984#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1985#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2018#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2015#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2017#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2016#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2014#L22-8 assume !(max_~i~0#1 < ~N~0); 2009#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2002#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 2003#L43-3 assume !(main_~i~1#1 < ~N~0 - 1); 1990#L43-4 call write~int(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1987#L22-13 [2021-12-19 20:23:45,995 INFO L793 eck$LassoCheckResult]: Loop: 1987#L22-13 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1991#L23-6 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1992#L23-8 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1986#L22-12 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1987#L22-13 [2021-12-19 20:23:45,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:45,995 INFO L85 PathProgramCache]: Analyzing trace with hash -249063647, now seen corresponding path program 1 times [2021-12-19 20:23:45,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:45,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907928339] [2021-12-19 20:23:45,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:45,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-19 20:23:46,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:23:46,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907928339] [2021-12-19 20:23:46,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907928339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:23:46,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 20:23:46,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 20:23:46,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615776517] [2021-12-19 20:23:46,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:23:46,026 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:23:46,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 1 times [2021-12-19 20:23:46,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:46,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174302849] [2021-12-19 20:23:46,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:46,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:46,029 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:46,031 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:46,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:23:46,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 20:23:46,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 20:23:46,063 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:23:46,077 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2021-12-19 20:23:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 20:23:46,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2021-12-19 20:23:46,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:23:46,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2021-12-19 20:23:46,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-19 20:23:46,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-19 20:23:46,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2021-12-19 20:23:46,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:46,078 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2021-12-19 20:23:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2021-12-19 20:23:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2021-12-19 20:23:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 55 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2021-12-19 20:23:46,080 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2021-12-19 20:23:46,080 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2021-12-19 20:23:46,080 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-19 20:23:46,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 69 transitions. [2021-12-19 20:23:46,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:23:46,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:46,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:46,081 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:46,081 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:23:46,081 INFO L791 eck$LassoCheckResult]: Stem: 2108#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 2109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2123#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2124#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2132#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2129#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2126#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2127#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2130#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2131#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2158#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2156#L22-3 assume !(max_~i~0#1 < ~N~0); 2146#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2144#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2142#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2139#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2104#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2105#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2137#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2134#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2136#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2135#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2133#L22-8 assume !(max_~i~0#1 < ~N~0); 2128#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2121#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 2122#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 2113#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2114#L43-3 assume !(main_~i~1#1 < ~N~0 - 1); 2110#L43-4 call write~int(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2107#L22-13 [2021-12-19 20:23:46,081 INFO L793 eck$LassoCheckResult]: Loop: 2107#L22-13 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2111#L23-6 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2112#L23-8 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2106#L22-12 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2107#L22-13 [2021-12-19 20:23:46,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1168061379, now seen corresponding path program 1 times [2021-12-19 20:23:46,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:46,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802107310] [2021-12-19 20:23:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:46,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:46,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:46,108 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:46,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:46,109 INFO L85 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 2 times [2021-12-19 20:23:46,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:46,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892207576] [2021-12-19 20:23:46,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:46,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:46,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:46,113 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:46,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash 934015144, now seen corresponding path program 1 times [2021-12-19 20:23:46,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:46,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829206935] [2021-12-19 20:23:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:46,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:46,134 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:46,156 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:50,014 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:23:50,014 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:23:50,014 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:23:50,014 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:23:50,014 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:23:50,014 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:50,014 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:23:50,014 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:23:50,014 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration11_Lasso [2021-12-19 20:23:50,014 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:23:50,015 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:23:50,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:50,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:50,491 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2021-12-19 20:23:51,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:51,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:52,108 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:23:52,108 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:23:52,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,111 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-19 20:23:52,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:23:52,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:23:52,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:23:52,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,141 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-19 20:23:52,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,184 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-19 20:23:52,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,193 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-19 20:23:52,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,201 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-19 20:23:52,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,234 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-19 20:23:52,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,272 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-19 20:23:52,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,304 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-19 20:23:52,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,351 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-19 20:23:52,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,386 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-19 20:23:52,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-19 20:23:52,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,434 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-19 20:23:52,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,531 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-19 20:23:52,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,565 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-19 20:23:52,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,603 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-19 20:23:52,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,634 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-19 20:23:52,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,661 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-19 20:23:52,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,692 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,693 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-19 20:23:52,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-12-19 20:23:52,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,724 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-19 20:23:52,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:52,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-12-19 20:23:52,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,766 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-19 20:23:52,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:52,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:52,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:52,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:52,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:52,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:52,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:52,793 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:23:52,804 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-19 20:23:52,804 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-19 20:23:52,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:52,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:52,805 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:52,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-19 20:23:52,807 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:23:52,814 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:23:52,814 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:23:52,814 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1) = -2*ULTIMATE.start_max_~i~0#1 + 3 Supporting invariants [] [2021-12-19 20:23:52,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:52,960 INFO L297 tatePredicateManager]: 41 out of 43 supporting invariants were superfluous and have been removed [2021-12-19 20:23:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:53,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 20:23:53,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:53,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:53,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 20:23:53,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:53,344 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2021-12-19 20:23:53,345 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 69 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:53,496 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 69 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 104 states and 131 transitions. Complement of second has 12 states. [2021-12-19 20:23:53,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-19 20:23:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2021-12-19 20:23:53,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 29 letters. Loop has 4 letters. [2021-12-19 20:23:53,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:53,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 33 letters. Loop has 4 letters. [2021-12-19 20:23:53,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:53,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 29 letters. Loop has 8 letters. [2021-12-19 20:23:53,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:53,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 131 transitions. [2021-12-19 20:23:53,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:23:53,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 67 states and 83 transitions. [2021-12-19 20:23:53,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-19 20:23:53,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-19 20:23:53,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 83 transitions. [2021-12-19 20:23:53,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:53,500 INFO L681 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2021-12-19 20:23:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 83 transitions. [2021-12-19 20:23:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2021-12-19 20:23:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 55 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2021-12-19 20:23:53,501 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2021-12-19 20:23:53,501 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2021-12-19 20:23:53,501 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-19 20:23:53,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 69 transitions. [2021-12-19 20:23:53,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:23:53,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:53,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:53,503 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:53,503 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:23:53,503 INFO L791 eck$LassoCheckResult]: Stem: 2588#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 2589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2604#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2605#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2614#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2639#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2638#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2637#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2636#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2635#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2634#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2633#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2624#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2630#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2627#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2623#L22-3 assume !(max_~i~0#1 < ~N~0); 2622#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2595#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2596#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2621#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2586#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2587#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2619#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2616#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2618#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2617#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2615#L22-8 assume !(max_~i~0#1 < ~N~0); 2610#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2602#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 2603#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 2593#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2594#L43-3 assume !(main_~i~1#1 < ~N~0 - 1); 2590#L43-4 call write~int(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2585#L22-13 [2021-12-19 20:23:53,503 INFO L793 eck$LassoCheckResult]: Loop: 2585#L22-13 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2591#L23-6 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2592#L23-8 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2584#L22-12 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2585#L22-13 [2021-12-19 20:23:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1580658666, now seen corresponding path program 2 times [2021-12-19 20:23:53,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:53,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855608020] [2021-12-19 20:23:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:53,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:23:53,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:23:53,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855608020] [2021-12-19 20:23:53,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855608020] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:23:53,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356590151] [2021-12-19 20:23:53,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:23:53,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:23:53,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:53,599 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:23:53,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2021-12-19 20:23:53,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:23:53,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:23:53,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 20:23:53,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:23:53,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:23:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:23:53,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356590151] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:23:53,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:23:53,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2021-12-19 20:23:53,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994570644] [2021-12-19 20:23:53,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:23:53,864 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:23:53,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 3 times [2021-12-19 20:23:53,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:53,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650151452] [2021-12-19 20:23:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:53,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:53,867 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:53,869 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:53,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:23:53,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 20:23:53,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-12-19 20:23:53,908 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. cyclomatic complexity: 18 Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:23:54,104 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2021-12-19 20:23:54,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-19 20:23:54,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 93 transitions. [2021-12-19 20:23:54,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:23:54,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 93 transitions. [2021-12-19 20:23:54,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-19 20:23:54,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-19 20:23:54,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 93 transitions. [2021-12-19 20:23:54,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:54,106 INFO L681 BuchiCegarLoop]: Abstraction has 75 states and 93 transitions. [2021-12-19 20:23:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 93 transitions. [2021-12-19 20:23:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2021-12-19 20:23:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 59 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2021-12-19 20:23:54,109 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 74 transitions. [2021-12-19 20:23:54,109 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 74 transitions. [2021-12-19 20:23:54,109 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-19 20:23:54,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 74 transitions. [2021-12-19 20:23:54,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:23:54,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:54,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:54,110 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:54,110 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:23:54,110 INFO L791 eck$LassoCheckResult]: Stem: 2946#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 2947#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2962#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2963#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2970#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2971#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3001#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3000#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2999#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2997#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2995#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2993#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2989#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2991#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2981#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2982#L22-3 assume !(max_~i~0#1 < ~N~0); 2964#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2965#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2957#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2958#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2942#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2943#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2987#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2986#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2985#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2984#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2983#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2975#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2977#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2976#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2974#L22-8 assume !(max_~i~0#1 < ~N~0); 2968#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2960#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 2961#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 2951#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2952#L43-3 assume !(main_~i~1#1 < ~N~0 - 1); 2948#L43-4 call write~int(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2945#L22-13 [2021-12-19 20:23:54,110 INFO L793 eck$LassoCheckResult]: Loop: 2945#L22-13 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2949#L23-6 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2950#L23-8 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2944#L22-12 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2945#L22-13 [2021-12-19 20:23:54,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash 477776739, now seen corresponding path program 3 times [2021-12-19 20:23:54,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:54,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614641265] [2021-12-19 20:23:54,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:54,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-19 20:23:54,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:23:54,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614641265] [2021-12-19 20:23:54,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614641265] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:23:54,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263807624] [2021-12-19 20:23:54,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 20:23:54,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:23:54,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:54,221 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:23:54,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2021-12-19 20:23:54,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-19 20:23:54,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:23:54,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 20:23:54,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-19 20:23:54,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:23:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-19 20:23:54,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263807624] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:23:54,464 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:23:54,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2021-12-19 20:23:54,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849390985] [2021-12-19 20:23:54,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:23:54,464 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:23:54,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:54,465 INFO L85 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 4 times [2021-12-19 20:23:54,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:54,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720368129] [2021-12-19 20:23:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:54,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:54,468 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:54,470 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:54,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:23:54,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 20:23:54,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-19 20:23:54,518 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. cyclomatic complexity: 19 Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:23:54,678 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2021-12-19 20:23:54,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-19 20:23:54,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 87 transitions. [2021-12-19 20:23:54,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:23:54,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 87 transitions. [2021-12-19 20:23:54,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-19 20:23:54,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-19 20:23:54,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2021-12-19 20:23:54,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:54,681 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2021-12-19 20:23:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2021-12-19 20:23:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2021-12-19 20:23:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2021-12-19 20:23:54,682 INFO L704 BuchiCegarLoop]: Abstraction has 62 states and 76 transitions. [2021-12-19 20:23:54,683 INFO L587 BuchiCegarLoop]: Abstraction has 62 states and 76 transitions. [2021-12-19 20:23:54,683 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-19 20:23:54,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 76 transitions. [2021-12-19 20:23:54,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-19 20:23:54,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:23:54,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:23:54,684 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:23:54,684 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:23:54,684 INFO L791 eck$LassoCheckResult]: Stem: 3328#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 3329#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 3343#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 3344#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3353#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 3352#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3347#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3348#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3355#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 3382#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3380#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3378#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3372#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 3376#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3374#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3371#L22-3 assume !(max_~i~0#1 < ~N~0); 3368#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 3335#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 3336#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3339#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 3324#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3325#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3365#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3364#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 3363#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3362#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3361#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3358#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 3360#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3359#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3357#L22-8 assume !(max_~i~0#1 < ~N~0); 3351#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 3341#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 3342#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 3349#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 3350#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 3333#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 3334#L43-3 assume !(main_~i~1#1 < ~N~0 - 1); 3330#L43-4 call write~int(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 3327#L22-13 [2021-12-19 20:23:54,684 INFO L793 eck$LassoCheckResult]: Loop: 3327#L22-13 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3331#L23-6 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 3332#L23-8 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3326#L22-12 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3327#L22-13 [2021-12-19 20:23:54,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:54,685 INFO L85 PathProgramCache]: Analyzing trace with hash -417996923, now seen corresponding path program 4 times [2021-12-19 20:23:54,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:54,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284111440] [2021-12-19 20:23:54,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:54,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:54,699 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:54,727 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:54,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 5 times [2021-12-19 20:23:54,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:54,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972894238] [2021-12-19 20:23:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:54,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:54,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:54,734 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1568478358, now seen corresponding path program 2 times [2021-12-19 20:23:54,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:23:54,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575811309] [2021-12-19 20:23:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:23:54,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:23:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:54,767 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:23:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:23:54,789 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:23:57,516 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:23:57,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:23:57,516 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:23:57,516 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:23:57,516 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:23:57,516 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:57,517 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:23:57,517 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:23:57,517 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration14_Lasso [2021-12-19 20:23:57,517 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:23:57,517 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:23:57,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:57,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 20:23:57,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 20:23:57,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:57,733 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2021-12-19 20:23:58,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:58,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:23:59,209 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:23:59,209 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:23:59,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,211 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-12-19 20:23:59,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:23:59,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:23:59,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:23:59,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:59,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,253 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-19 20:23:59,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:59,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:59,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:59,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,304 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-19 20:23:59,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:23:59,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:23:59,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:23:59,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:59,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,345 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-12-19 20:23:59,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:59,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:59,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:59,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,374 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-19 20:23:59,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:59,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:59,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-12-19 20:23:59,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,402 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-19 20:23:59,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:59,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:59,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-12-19 20:23:59,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,431 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-19 20:23:59,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:59,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:59,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:59,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,476 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-19 20:23:59,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:59,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:59,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-12-19 20:23:59,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,504 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-19 20:23:59,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,513 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-19 20:23:59,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,521 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-19 20:23:59,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:59,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-12-19 20:23:59,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,548 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-19 20:23:59,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:59,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:59,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-12-19 20:23:59,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,577 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-12-19 20:23:59,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:59,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:59,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-12-19 20:23:59,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,616 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-19 20:23:59,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:59,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:59,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:23:59,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2021-12-19 20:23:59,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,644 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-12-19 20:23:59,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:23:59,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:23:59,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:23:59,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:23:59,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:23:59,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:23:59,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:23:59,664 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:23:59,675 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-19 20:23:59,676 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-12-19 20:23:59,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:23:59,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:23:59,677 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:23:59,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-12-19 20:23:59,678 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:23:59,685 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:23:59,685 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:23:59,685 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1, ~N~0) = -1*ULTIMATE.start_max_~i~0#1 + 1*~N~0 Supporting invariants [] [2021-12-19 20:23:59,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2021-12-19 20:23:59,772 INFO L297 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2021-12-19 20:23:59,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:23:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:59,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 20:23:59,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:23:59,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:23:59,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:23:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:23:59,900 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-19 20:23:59,900 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 76 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:59,908 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 76 transitions. cyclomatic complexity: 19. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 66 states and 82 transitions. Complement of second has 4 states. [2021-12-19 20:23:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-19 20:23:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:23:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2021-12-19 20:23:59,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 39 letters. Loop has 4 letters. [2021-12-19 20:23:59,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:59,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 43 letters. Loop has 4 letters. [2021-12-19 20:23:59,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:59,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 39 letters. Loop has 8 letters. [2021-12-19 20:23:59,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:23:59,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 82 transitions. [2021-12-19 20:23:59,910 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-19 20:23:59,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2021-12-19 20:23:59,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-19 20:23:59,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-19 20:23:59,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-19 20:23:59,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:23:59,910 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 20:23:59,910 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 20:23:59,910 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-19 20:23:59,910 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-19 20:23:59,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-19 20:23:59,911 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-19 20:23:59,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-19 20:23:59,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.12 08:23:59 BoogieIcfgContainer [2021-12-19 20:23:59,917 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-19 20:23:59,918 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-19 20:23:59,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-19 20:23:59,918 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-19 20:23:59,918 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:23:31" (3/4) ... [2021-12-19 20:23:59,928 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-19 20:23:59,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-19 20:23:59,929 INFO L158 Benchmark]: Toolchain (without parser) took 28701.52ms. Allocated memory was 92.3MB in the beginning and 237.0MB in the end (delta: 144.7MB). Free memory was 61.6MB in the beginning and 156.3MB in the end (delta: -94.7MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2021-12-19 20:23:59,929 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 45.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 20:23:59,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.52ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 67.6MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-19 20:23:59,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.58ms. Allocated memory is still 92.3MB. Free memory was 67.6MB in the beginning and 65.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 20:23:59,930 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 92.3MB. Free memory was 65.6MB in the beginning and 64.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 20:23:59,930 INFO L158 Benchmark]: RCFGBuilder took 307.76ms. Allocated memory is still 92.3MB. Free memory was 64.1MB in the beginning and 52.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-19 20:23:59,931 INFO L158 Benchmark]: BuchiAutomizer took 28100.40ms. Allocated memory was 92.3MB in the beginning and 237.0MB in the end (delta: 144.7MB). Free memory was 51.8MB in the beginning and 156.3MB in the end (delta: -104.5MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2021-12-19 20:23:59,931 INFO L158 Benchmark]: Witness Printer took 10.43ms. Allocated memory is still 237.0MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 20:23:59,933 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 45.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.52ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 67.6MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.58ms. Allocated memory is still 92.3MB. Free memory was 67.6MB in the beginning and 65.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 92.3MB. Free memory was 65.6MB in the beginning and 64.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.76ms. Allocated memory is still 92.3MB. Free memory was 64.1MB in the beginning and 52.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 28100.40ms. Allocated memory was 92.3MB in the beginning and 237.0MB in the end (delta: 144.7MB). Free memory was 51.8MB in the beginning and 156.3MB in the end (delta: -104.5MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * Witness Printer took 10.43ms. Allocated memory is still 237.0MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (9 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[x] and consists of 8 locations. One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 10 locations. One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.0s and 15 iterations. TraceHistogramMax:3. Analysis of lassos took 24.7s. Construction of modules took 0.9s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 172 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 62 states and ocurred in iteration 13. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 721 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 719 mSDsluCounter, 878 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 71 IncrementalHoareTripleChecker+Unchecked, 605 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2081 IncrementalHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 273 mSDtfsCounter, 2081 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU8 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital401 mio100 ax100 hnf99 lsp115 ukn82 mio100 lsp31 div123 bol100 ite100 ukn100 eq164 hnf78 smp78 dnf276 smp55 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 8 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-19 20:23:59,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2021-12-19 20:24:00,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2021-12-19 20:24:00,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2021-12-19 20:24:00,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-12-19 20:24:00,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-12-19 20:24:00,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-19 20:24:01,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-19 20:24:01,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE