./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sep05-1.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/sep05-1.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 ac50477087b7e2b9c80860ad42d4d46d99ddf32e797cee205c21d5ff44f08ec3 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 10:15:44,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 10:15:44,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 10:15:44,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 10:15:44,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 10:15:44,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 10:15:44,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 10:15:44,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 10:15:44,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 10:15:44,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 10:15:44,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 10:15:44,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 10:15:44,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 10:15:44,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 10:15:44,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 10:15:44,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 10:15:44,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 10:15:44,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 10:15:44,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 10:15:44,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 10:15:44,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 10:15:44,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 10:15:44,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 10:15:44,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 10:15:44,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 10:15:44,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 10:15:44,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 10:15:44,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 10:15:44,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 10:15:44,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 10:15:44,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 10:15:44,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 10:15:44,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 10:15:44,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 10:15:44,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 10:15:44,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 10:15:44,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 10:15:44,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 10:15:44,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 10:15:44,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 10:15:44,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 10:15:44,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-16 10:15:44,332 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 10:15:44,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 10:15:44,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 10:15:44,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 10:15:44,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 10:15:44,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 10:15:44,335 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 10:15:44,335 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 10:15:44,335 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 10:15:44,335 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 10:15:44,336 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 10:15:44,337 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 10:15:44,337 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 10:15:44,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 10:15:44,337 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 10:15:44,337 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 10:15:44,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 10:15:44,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 10:15:44,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 10:15:44,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 10:15:44,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 10:15:44,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 10:15:44,339 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 10:15:44,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 10:15:44,339 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 10:15:44,339 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 10:15:44,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 10:15:44,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 10:15:44,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 10:15:44,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 10:15:44,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 10:15:44,341 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 10:15:44,341 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 10:15:44,342 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 -> ac50477087b7e2b9c80860ad42d4d46d99ddf32e797cee205c21d5ff44f08ec3 [2021-12-16 10:15:44,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 10:15:44,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 10:15:44,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 10:15:44,637 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 10:15:44,639 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 10:15:44,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep05-1.i [2021-12-16 10:15:44,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47ddcde9/68ca4250f82747daa3a6f9ce5421a59e/FLAG9621e6f2d [2021-12-16 10:15:45,101 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 10:15:45,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep05-1.i [2021-12-16 10:15:45,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47ddcde9/68ca4250f82747daa3a6f9ce5421a59e/FLAG9621e6f2d [2021-12-16 10:15:45,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47ddcde9/68ca4250f82747daa3a6f9ce5421a59e [2021-12-16 10:15:45,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 10:15:45,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 10:15:45,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 10:15:45,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 10:15:45,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 10:15:45,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1649003d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45, skipping insertion in model container [2021-12-16 10:15:45,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 10:15:45,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 10:15:45,361 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/sep05-1.i[1287,1300] [2021-12-16 10:15:45,362 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:15:45,370 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 10:15:45,397 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/sep05-1.i[1287,1300] [2021-12-16 10:15:45,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 10:15:45,411 INFO L208 MainTranslator]: Completed translation [2021-12-16 10:15:45,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45 WrapperNode [2021-12-16 10:15:45,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 10:15:45,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 10:15:45,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 10:15:45,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 10:15:45,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,459 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2021-12-16 10:15:45,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 10:15:45,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 10:15:45,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 10:15:45,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 10:15:45,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 10:15:45,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 10:15:45,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 10:15:45,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 10:15:45,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45" (1/1) ... [2021-12-16 10:15:45,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:45,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:45,532 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-16 10:15:45,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-16 10:15:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 10:15:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 10:15:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 10:15:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 10:15:45,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 10:15:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 10:15:45,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 10:15:45,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 10:15:45,651 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 10:15:45,652 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 10:15:45,840 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 10:15:45,861 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 10:15:45,862 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-16 10:15:45,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:15:45 BoogieIcfgContainer [2021-12-16 10:15:45,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 10:15:45,864 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 10:15:45,865 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 10:15:45,868 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 10:15:45,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:15:45,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 10:15:45" (1/3) ... [2021-12-16 10:15:45,869 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e476e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:15:45, skipping insertion in model container [2021-12-16 10:15:45,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:15:45,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:15:45" (2/3) ... [2021-12-16 10:15:45,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e476e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 10:15:45, skipping insertion in model container [2021-12-16 10:15:45,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 10:15:45,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:15:45" (3/3) ... [2021-12-16 10:15:45,871 INFO L388 chiAutomizerObserver]: Analyzing ICFG sep05-1.i [2021-12-16 10:15:45,943 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 10:15:45,943 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 10:15:45,943 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 10:15:45,944 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 10:15:45,944 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 10:15:45,944 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 10:15:45,944 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 10:15:45,944 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 10:15:45,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 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-16 10:15:45,970 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-12-16 10:15:45,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:45,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:45,975 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 10:15:45,975 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:15:45,975 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 10:15:45,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 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-16 10:15:45,980 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2021-12-16 10:15:45,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:45,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:45,981 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 10:15:45,981 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:15:45,987 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(10, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 27#L37-3true [2021-12-16 10:15:45,987 INFO L793 eck$LassoCheckResult]: Loop: 27#L37-3true assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 18#L37-2true main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 27#L37-3true [2021-12-16 10:15:45,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:45,996 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-16 10:15:46,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:46,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352085501] [2021-12-16 10:15:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:46,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:46,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:46,128 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:46,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-16 10:15:46,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:46,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613478793] [2021-12-16 10:15:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:46,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:46,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:46,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:46,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:46,168 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-16 10:15:46,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:46,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175263195] [2021-12-16 10:15:46,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:46,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:46,200 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:46,228 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:46,497 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:15:46,498 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:15:46,498 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:15:46,498 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:15:46,498 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:15:46,498 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:46,499 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:15:46,499 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:15:46,499 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration1_Lasso [2021-12-16 10:15:46,499 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:15:46,499 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:15:46,515 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-16 10:15:46,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:46,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-16 10:15:46,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:46,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:46,645 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-16 10:15:46,648 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-16 10:15:46,653 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-16 10:15:46,655 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-16 10:15:46,659 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-16 10:15:46,661 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-16 10:15:46,663 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-16 10:15:46,665 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-16 10:15:46,667 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-16 10:15:46,669 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-16 10:15:46,671 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-16 10:15:46,673 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-16 10:15:46,675 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-16 10:15:46,926 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:15:46,929 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 10:15:46,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:46,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:46,935 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-16 10:15:46,942 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-16 10:15:46,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:46,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:46,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:46,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:46,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:46,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:46,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:46,957 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-16 10:15:46,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:46,990 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-16 10:15:46,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:46,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:46,992 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-16 10:15:46,993 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-16 10:15:46,994 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-16 10:15:47,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:47,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:47,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:47,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:47,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:47,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:47,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:47,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:47,027 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-16 10:15:47,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:47,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:47,029 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-16 10:15:47,035 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-16 10:15:47,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-16 10:15:47,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:47,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:47,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:47,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:47,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:47,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:47,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:47,083 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-16 10:15:47,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:47,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:47,085 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-16 10:15:47,085 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-16 10:15:47,086 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-16 10:15:47,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:47,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:47,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:47,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:47,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:47,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:47,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:47,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:47,111 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-16 10:15:47,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:47,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:47,112 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-16 10:15:47,113 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-16 10:15:47,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-16 10:15:47,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:47,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:47,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:47,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:47,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:47,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:47,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:47,175 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-16 10:15:47,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:47,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:47,177 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-16 10:15:47,177 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-16 10:15:47,179 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-16 10:15:47,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:47,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:47,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:47,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:47,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:47,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:47,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:47,207 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-16 10:15:47,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:47,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:47,208 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-16 10:15:47,210 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-16 10:15:47,211 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-16 10:15:47,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:47,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:47,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:47,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:47,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:47,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:47,235 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 10:15:47,251 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2021-12-16 10:15:47,251 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-12-16 10:15:47,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:47,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:47,257 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-16 10:15:47,258 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-16 10:15:47,305 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 10:15:47,341 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 10:15:47,341 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 10:15:47,341 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2021-12-16 10:15:47,391 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-16 10:15:47,401 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2021-12-16 10:15:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:47,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 10:15:47,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:15:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:47,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 10:15:47,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:15:47,541 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-16 10:15:47,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:47,568 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-16 10:15:47,569 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:47,633 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 75 states and 110 transitions. Complement of second has 8 states. [2021-12-16 10:15:47,634 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-16 10:15:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2021-12-16 10:15:47,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-16 10:15:47,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:15:47,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-16 10:15:47,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:15:47,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-16 10:15:47,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:15:47,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 110 transitions. [2021-12-16 10:15:47,649 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:15:47,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 30 transitions. [2021-12-16 10:15:47,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-16 10:15:47,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-16 10:15:47,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-12-16 10:15:47,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:15:47,653 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-16 10:15:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-12-16 10:15:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-16 10:15:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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-16 10:15:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2021-12-16 10:15:47,670 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-16 10:15:47,671 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-16 10:15:47,671 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 10:15:47,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2021-12-16 10:15:47,672 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:15:47,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:47,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:47,672 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-16 10:15:47,672 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 10:15:47,672 INFO L791 eck$LassoCheckResult]: Stem: 165#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(10, 2); 166#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 174#L37-3 assume !(main_~i~1#1 < 5); 179#L37-4 assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 180#L18-3 [2021-12-16 10:15:47,673 INFO L793 eck$LassoCheckResult]: Loop: 180#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 183#L20 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 181#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 180#L18-3 [2021-12-16 10:15:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-12-16 10:15:47,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:47,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834260556] [2021-12-16 10:15:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:47,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:47,702 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-16 10:15:47,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:15:47,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834260556] [2021-12-16 10:15:47,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834260556] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:15:47,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:15:47,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:15:47,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099057179] [2021-12-16 10:15:47,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:15:47,706 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:15:47,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:47,706 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2021-12-16 10:15:47,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:47,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959514359] [2021-12-16 10:15:47,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:47,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:47,717 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:47,724 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:47,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:15:47,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:15:47,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:15:47,777 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:15:47,792 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2021-12-16 10:15:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:15:47,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2021-12-16 10:15:47,794 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:15:47,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2021-12-16 10:15:47,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-16 10:15:47,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-16 10:15:47,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2021-12-16 10:15:47,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:15:47,797 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2021-12-16 10:15:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2021-12-16 10:15:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-12-16 10:15:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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-16 10:15:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2021-12-16 10:15:47,799 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2021-12-16 10:15:47,799 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2021-12-16 10:15:47,799 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 10:15:47,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2021-12-16 10:15:47,801 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:15:47,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:47,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:47,801 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 10:15:47,801 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 10:15:47,801 INFO L791 eck$LassoCheckResult]: Stem: 216#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(10, 2); 217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 225#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 214#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 215#L37-3 assume !(main_~i~1#1 < 5); 230#L37-4 assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 231#L18-3 [2021-12-16 10:15:47,802 INFO L793 eck$LassoCheckResult]: Loop: 231#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 234#L20 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 232#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 231#L18-3 [2021-12-16 10:15:47,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-12-16 10:15:47,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:47,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589534855] [2021-12-16 10:15:47,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:47,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:47,833 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-16 10:15:47,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:15:47,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589534855] [2021-12-16 10:15:47,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589534855] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:15:47,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23931011] [2021-12-16 10:15:47,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:47,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:15:47,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:47,836 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 10:15:47,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-16 10:15:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:47,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 10:15:47,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:15:47,891 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-16 10:15:47,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 10:15:47,914 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-16 10:15:47,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23931011] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 10:15:47,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 10:15:47,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-16 10:15:47,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613825856] [2021-12-16 10:15:47,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 10:15:47,915 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:15:47,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2021-12-16 10:15:47,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:47,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456605244] [2021-12-16 10:15:47,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:47,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:47,933 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:47,945 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:47,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:15:47,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 10:15:47,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-16 10:15:47,996 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:15:48,027 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2021-12-16 10:15:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 10:15:48,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2021-12-16 10:15:48,032 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:15:48,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2021-12-16 10:15:48,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-16 10:15:48,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-16 10:15:48,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2021-12-16 10:15:48,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:15:48,033 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-16 10:15:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2021-12-16 10:15:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-16 10:15:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-16 10:15:48,037 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-16 10:15:48,037 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-16 10:15:48,037 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 10:15:48,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2021-12-16 10:15:48,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:15:48,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:48,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:48,042 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-12-16 10:15:48,046 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 10:15:48,047 INFO L791 eck$LassoCheckResult]: Stem: 306#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(10, 2); 307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 315#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 304#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 305#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 326#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 331#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 330#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 329#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 328#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 327#L37-3 assume !(main_~i~1#1 < 5); 320#L37-4 assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 321#L18-3 [2021-12-16 10:15:48,048 INFO L793 eck$LassoCheckResult]: Loop: 321#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 324#L20 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 322#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 321#L18-3 [2021-12-16 10:15:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2021-12-16 10:15:48,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:48,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541502649] [2021-12-16 10:15:48,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:48,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:15:48,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:15:48,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541502649] [2021-12-16 10:15:48,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541502649] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:15:48,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815999110] [2021-12-16 10:15:48,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 10:15:48,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:15:48,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:48,116 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-16 10:15:48,117 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-16 10:15:48,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 10:15:48,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 10:15:48,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 10:15:48,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:15:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:15:48,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 10:15:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 10:15:48,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815999110] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 10:15:48,266 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 10:15:48,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-12-16 10:15:48,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460339467] [2021-12-16 10:15:48,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 10:15:48,267 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:15:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2021-12-16 10:15:48,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:48,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235237879] [2021-12-16 10:15:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:48,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:48,284 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:48,298 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:48,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:15:48,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 10:15:48,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-16 10:15:48,346 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:15:48,371 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2021-12-16 10:15:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 10:15:48,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2021-12-16 10:15:48,375 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:15:48,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2021-12-16 10:15:48,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-16 10:15:48,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-16 10:15:48,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2021-12-16 10:15:48,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:15:48,377 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-16 10:15:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2021-12-16 10:15:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-16 10:15:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 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-16 10:15:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-12-16 10:15:48,380 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-16 10:15:48,380 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-12-16 10:15:48,381 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 10:15:48,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2021-12-16 10:15:48,381 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2021-12-16 10:15:48,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:48,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:48,382 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-12-16 10:15:48,382 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 10:15:48,382 INFO L791 eck$LassoCheckResult]: Stem: 441#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(10, 2); 442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 450#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 439#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 440#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 461#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 468#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 467#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 466#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 465#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 464#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 463#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 462#L37-3 assume !(main_~i~1#1 < 5); 455#L37-4 assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 456#L18-3 [2021-12-16 10:15:48,382 INFO L793 eck$LassoCheckResult]: Loop: 456#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 459#L20 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 457#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 456#L18-3 [2021-12-16 10:15:48,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2021-12-16 10:15:48,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:48,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682268285] [2021-12-16 10:15:48,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:48,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:48,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:48,422 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:48,423 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2021-12-16 10:15:48,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:48,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823257599] [2021-12-16 10:15:48,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:48,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:48,428 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:48,432 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2021-12-16 10:15:48,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:48,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046263347] [2021-12-16 10:15:48,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:48,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:48,450 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:48,475 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:49,173 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:15:49,173 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:15:49,173 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:15:49,173 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:15:49,173 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:15:49,173 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:49,173 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:15:49,173 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:15:49,173 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration5_Lasso [2021-12-16 10:15:49,174 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:15:49,174 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:15:49,176 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-16 10:15:49,179 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-16 10:15:49,184 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-16 10:15:49,186 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-16 10:15:49,188 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-16 10:15:49,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:49,191 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-16 10:15:49,194 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-16 10:15:49,195 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-16 10:15:49,197 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-16 10:15:49,199 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-16 10:15:49,200 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-16 10:15:49,202 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-16 10:15:49,205 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-16 10:15:49,207 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-16 10:15:49,209 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-16 10:15:49,210 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-16 10:15:49,212 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-16 10:15:49,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-16 10:15:49,488 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-16 10:15:49,490 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-16 10:15:49,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:49,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:49,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 10:15:49,498 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-16 10:15:49,801 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:15:49,802 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 10:15:49,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:49,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:49,808 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:49,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-16 10:15:49,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:49,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:49,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:49,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:49,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:49,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:49,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:49,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:49,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:49,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:49,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:49,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:49,832 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-16 10:15:49,835 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-16 10:15:49,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-16 10:15:49,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:49,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:49,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:49,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:49,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:49,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:49,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:49,863 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-16 10:15:49,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:49,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:49,864 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-16 10:15:49,873 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-16 10:15:49,873 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-16 10:15:49,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:49,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:49,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:49,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:49,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:49,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:49,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:49,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:49,931 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-16 10:15:49,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:49,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:49,932 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-16 10:15:49,944 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-16 10:15:49,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:49,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:49,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:49,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:49,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:49,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:49,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:49,954 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-16 10:15:49,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:49,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-16 10:15:49,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:49,976 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-16 10:15:49,977 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-16 10:15:49,978 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-16 10:15:49,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:49,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:49,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:49,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:49,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:49,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:49,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:49,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,014 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-16 10:15:50,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,016 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-16 10:15:50,016 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-16 10:15:50,018 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-16 10:15:50,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:50,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:50,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:50,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:50,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,062 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-16 10:15:50,062 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-16 10:15:50,064 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-16 10:15:50,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:50,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:50,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,114 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-16 10:15:50,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,116 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-16 10:15:50,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-16 10:15:50,122 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-16 10:15:50,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:50,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:50,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:50,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,158 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-16 10:15:50,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,159 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-16 10:15:50,162 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-16 10:15:50,163 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-16 10:15:50,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:50,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:50,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:50,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,186 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-16 10:15:50,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,187 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-16 10:15:50,188 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-16 10:15:50,189 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-16 10:15:50,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:50,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:50,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:50,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,212 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-16 10:15:50,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,213 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-16 10:15:50,214 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-16 10:15:50,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-16 10:15:50,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:50,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:50,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:50,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:50,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,240 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-16 10:15:50,240 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-16 10:15:50,241 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-16 10:15:50,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:50,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:50,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:50,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,262 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-16 10:15:50,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,264 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:50,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-16 10:15:50,266 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-16 10:15:50,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:50,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:50,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-16 10:15:50,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,291 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:50,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-16 10:15:50,293 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-16 10:15:50,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:50,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:50,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:50,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-16 10:15:50,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,315 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-16 10:15:50,316 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-16 10:15:50,318 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-16 10:15:50,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:50,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:50,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:50,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-16 10:15:50,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,341 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-16 10:15:50,345 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-16 10:15:50,345 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-16 10:15:50,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:50,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:50,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:50,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-16 10:15:50,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,368 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 10:15:50,368 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-16 10:15:50,370 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-16 10:15:50,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:50,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:50,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:50,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-16 10:15:50,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,392 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-16 10:15:50,393 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-16 10:15:50,394 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-16 10:15:50,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:50,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:50,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,434 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-16 10:15:50,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,435 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-16 10:15:50,436 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-16 10:15:50,437 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-16 10:15:50,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:50,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:50,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,465 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-16 10:15:50,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,466 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-16 10:15:50,466 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-16 10:15:50,468 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-16 10:15:50,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:50,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:50,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:50,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:50,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,517 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-16 10:15:50,518 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-16 10:15:50,519 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-16 10:15:50,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:50,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:50,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:50,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:50,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:50,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:50,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 10:15:50,546 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-12-16 10:15:50,546 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-12-16 10:15:50,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:50,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,547 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-16 10:15:50,548 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-16 10:15:50,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 10:15:50,555 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 10:15:50,555 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 10:15:50,555 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2, ULTIMATE.start_sep_~i~0#1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2 - 8*ULTIMATE.start_sep_~i~0#1 Supporting invariants [] [2021-12-16 10:15:50,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-16 10:15:50,631 INFO L297 tatePredicateManager]: 28 out of 29 supporting invariants were superfluous and have been removed [2021-12-16 10:15:50,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:50,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 10:15:50,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:15:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:50,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 10:15:50,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:15:50,734 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-16 10:15:50,735 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-16 10:15:50,735 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-16 10:15:50,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 35 states and 46 transitions. Complement of second has 7 states. [2021-12-16 10:15:50,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 10:15:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-16 10:15:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-16 10:15:50,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-16 10:15:50,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:15:50,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2021-12-16 10:15:50,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:15:50,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 6 letters. [2021-12-16 10:15:50,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:15:50,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2021-12-16 10:15:50,768 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-16 10:15:50,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 39 transitions. [2021-12-16 10:15:50,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-16 10:15:50,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-16 10:15:50,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2021-12-16 10:15:50,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:15:50,770 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-16 10:15:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2021-12-16 10:15:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-16 10:15:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-12-16 10:15:50,773 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-16 10:15:50,773 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-16 10:15:50,773 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 10:15:50,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2021-12-16 10:15:50,773 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-16 10:15:50,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:50,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:50,774 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:15:50,774 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 10:15:50,774 INFO L791 eck$LassoCheckResult]: Stem: 702#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(10, 2); 703#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 711#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 700#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 701#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 723#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 730#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 729#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 728#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 727#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 726#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 725#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 724#L37-3 assume !(main_~i~1#1 < 5); 716#L37-4 assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 717#L18-3 assume !(sep_~i~0#1 < 5); 720#L18-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 704#L25 main_#t~ret7#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 705#L18-8 [2021-12-16 10:15:50,775 INFO L793 eck$LassoCheckResult]: Loop: 705#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 715#L20-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 722#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 705#L18-8 [2021-12-16 10:15:50,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1638581187, now seen corresponding path program 1 times [2021-12-16 10:15:50,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:50,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92253713] [2021-12-16 10:15:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:50,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-16 10:15:50,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:15:50,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92253713] [2021-12-16 10:15:50,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92253713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:15:50,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 10:15:50,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 10:15:50,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217115664] [2021-12-16 10:15:50,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:15:50,803 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:15:50,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash 74576, now seen corresponding path program 1 times [2021-12-16 10:15:50,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:50,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554719281] [2021-12-16 10:15:50,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:50,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:50,814 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:50,818 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:50,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:15:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 10:15:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 10:15:50,867 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-16 10:15:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:15:50,882 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2021-12-16 10:15:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 10:15:50,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2021-12-16 10:15:50,885 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-16 10:15:50,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2021-12-16 10:15:50,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-16 10:15:50,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-16 10:15:50,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2021-12-16 10:15:50,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:15:50,887 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2021-12-16 10:15:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2021-12-16 10:15:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2021-12-16 10:15:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-12-16 10:15:50,889 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-16 10:15:50,890 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-16 10:15:50,890 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-16 10:15:50,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2021-12-16 10:15:50,890 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-16 10:15:50,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:50,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:50,892 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:15:50,892 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 10:15:50,893 INFO L791 eck$LassoCheckResult]: Stem: 778#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(10, 2); 779#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 787#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 776#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 777#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 800#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 807#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 806#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 805#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 804#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 803#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 802#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 801#L37-3 assume !(main_~i~1#1 < 5); 792#L37-4 assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 793#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 796#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 794#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 795#L18-3 assume !(sep_~i~0#1 < 5); 797#L18-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 780#L25 main_#t~ret7#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 781#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 790#L20-2 [2021-12-16 10:15:50,893 INFO L793 eck$LassoCheckResult]: Loop: 790#L20-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 798#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 799#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 790#L20-2 [2021-12-16 10:15:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1567455174, now seen corresponding path program 1 times [2021-12-16 10:15:50,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:50,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328935795] [2021-12-16 10:15:50,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:50,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:50,948 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-16 10:15:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-16 10:15:50,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:15:50,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328935795] [2021-12-16 10:15:50,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328935795] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:15:50,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470798984] [2021-12-16 10:15:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:50,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:15:50,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:50,971 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 10:15:50,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-12-16 10:15:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:51,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 10:15:51,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:15:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-16 10:15:51,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 10:15:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-16 10:15:51,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470798984] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 10:15:51,093 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 10:15:51,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-16 10:15:51,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537429358] [2021-12-16 10:15:51,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 10:15:51,093 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:15:51,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:51,094 INFO L85 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 2 times [2021-12-16 10:15:51,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:51,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484292763] [2021-12-16 10:15:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:51,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:51,099 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:51,103 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:51,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:15:51,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 10:15:51,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-16 10:15:51,147 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:15:51,196 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2021-12-16 10:15:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 10:15:51,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2021-12-16 10:15:51,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-16 10:15:51,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 76 transitions. [2021-12-16 10:15:51,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-12-16 10:15:51,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-12-16 10:15:51,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2021-12-16 10:15:51,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:15:51,199 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2021-12-16 10:15:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2021-12-16 10:15:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2021-12-16 10:15:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.26) internal successors, (63), 49 states have internal predecessors, (63), 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-16 10:15:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2021-12-16 10:15:51,202 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2021-12-16 10:15:51,202 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2021-12-16 10:15:51,202 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-16 10:15:51,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2021-12-16 10:15:51,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-16 10:15:51,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:51,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:51,204 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:15:51,204 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 10:15:51,204 INFO L791 eck$LassoCheckResult]: Stem: 1000#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(10, 2); 1001#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1009#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 998#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 999#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1024#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1047#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1046#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1045#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1044#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1043#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1042#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1041#L37-3 assume !(main_~i~1#1 < 5); 1015#L37-4 assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1016#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1019#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1017#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1018#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1020#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1038#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1036#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1034#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1032#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1031#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1026#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1027#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1025#L18-3 assume !(sep_~i~0#1 < 5); 1021#L18-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1002#L25 main_#t~ret7#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1003#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1022#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1023#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1012#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1013#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1040#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1039#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1037#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1035#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1033#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1029#L20-2 [2021-12-16 10:15:51,205 INFO L793 eck$LassoCheckResult]: Loop: 1029#L20-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 1030#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1028#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1029#L20-2 [2021-12-16 10:15:51,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash -534676351, now seen corresponding path program 1 times [2021-12-16 10:15:51,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:51,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094518958] [2021-12-16 10:15:51,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:51,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-16 10:15:51,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:15:51,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094518958] [2021-12-16 10:15:51,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094518958] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:15:51,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313141598] [2021-12-16 10:15:51,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:51,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:15:51,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:51,267 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 10:15:51,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-12-16 10:15:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:51,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 10:15:51,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:15:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-16 10:15:51,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 10:15:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-16 10:15:51,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313141598] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 10:15:51,456 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 10:15:51,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2021-12-16 10:15:51,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831346995] [2021-12-16 10:15:51,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 10:15:51,456 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 10:15:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:51,457 INFO L85 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 3 times [2021-12-16 10:15:51,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:51,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345769738] [2021-12-16 10:15:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:51,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:51,462 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:51,466 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:51,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:15:51,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 10:15:51,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-16 10:15:51,507 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. cyclomatic complexity: 18 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-16 10:15:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:15:51,557 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2021-12-16 10:15:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 10:15:51,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 88 transitions. [2021-12-16 10:15:51,558 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-16 10:15:51,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 88 transitions. [2021-12-16 10:15:51,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2021-12-16 10:15:51,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-12-16 10:15:51,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 88 transitions. [2021-12-16 10:15:51,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:15:51,560 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2021-12-16 10:15:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 88 transitions. [2021-12-16 10:15:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2021-12-16 10:15:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 55 states have internal predecessors, (71), 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-16 10:15:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2021-12-16 10:15:51,563 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2021-12-16 10:15:51,563 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2021-12-16 10:15:51,563 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-16 10:15:51,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 71 transitions. [2021-12-16 10:15:51,564 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2021-12-16 10:15:51,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:51,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:51,565 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:15:51,565 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 10:15:51,565 INFO L791 eck$LassoCheckResult]: Stem: 1358#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(10, 2); 1359#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1367#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1356#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1357#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1382#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1411#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1410#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1409#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1408#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1407#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1406#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1405#L37-3 assume !(main_~i~1#1 < 5); 1373#L37-4 assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1374#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1377#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1375#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1376#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1378#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1402#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1400#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1398#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1396#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1394#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1392#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1390#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1389#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1384#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1385#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1383#L18-3 assume !(sep_~i~0#1 < 5); 1379#L18-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1360#L25 main_#t~ret7#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1361#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1380#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1381#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1370#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1371#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1404#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1403#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1401#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1399#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1397#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1395#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1393#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1391#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1387#L20-2 [2021-12-16 10:15:51,566 INFO L793 eck$LassoCheckResult]: Loop: 1387#L20-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 1388#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1386#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1387#L20-2 [2021-12-16 10:15:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1616244090, now seen corresponding path program 2 times [2021-12-16 10:15:51,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:51,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428718889] [2021-12-16 10:15:51,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:51,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:51,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:51,730 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 4 times [2021-12-16 10:15:51,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:51,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595640589] [2021-12-16 10:15:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:51,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:51,738 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:51,741 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:51,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1350622481, now seen corresponding path program 1 times [2021-12-16 10:15:51,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:51,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449526977] [2021-12-16 10:15:51,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:51,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-16 10:15:51,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 10:15:51,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449526977] [2021-12-16 10:15:51,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449526977] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 10:15:51,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778429513] [2021-12-16 10:15:51,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:51,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 10:15:51,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:51,812 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 10:15:51,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-12-16 10:15:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:51,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 10:15:51,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:15:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-16 10:15:51,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 10:15:51,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778429513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 10:15:51,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 10:15:51,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2021-12-16 10:15:51,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378943972] [2021-12-16 10:15:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 10:15:51,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 10:15:51,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 10:15:51,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-12-16 10:15:51,996 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. cyclomatic complexity: 20 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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-16 10:15:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 10:15:52,069 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2021-12-16 10:15:52,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 10:15:52,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2021-12-16 10:15:52,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 10:15:52,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 52 states and 63 transitions. [2021-12-16 10:15:52,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-16 10:15:52,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-12-16 10:15:52,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2021-12-16 10:15:52,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:15:52,071 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-12-16 10:15:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2021-12-16 10:15:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-16 10:15:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 51 states have internal predecessors, (63), 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-16 10:15:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2021-12-16 10:15:52,074 INFO L704 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-12-16 10:15:52,074 INFO L587 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2021-12-16 10:15:52,074 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-16 10:15:52,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 63 transitions. [2021-12-16 10:15:52,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-16 10:15:52,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 10:15:52,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 10:15:52,076 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 10:15:52,076 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-16 10:15:52,076 INFO L791 eck$LassoCheckResult]: Stem: 1638#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(10, 2); 1639#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1645#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1636#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1637#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1656#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1671#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1669#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1667#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1665#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1663#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 1660#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1659#L37-3 assume !(main_~i~1#1 < 5); 1648#L37-4 assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1649#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1687#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1650#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1651#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1652#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1657#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1686#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1685#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1684#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1683#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1682#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1681#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1680#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1679#L20 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1678#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1677#L18-3 assume !(sep_~i~0#1 < 5); 1653#L18-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1640#L25 main_#t~ret7#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1641#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1646#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1654#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1655#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1676#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1675#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1674#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1673#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1672#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1670#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1668#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1666#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1664#L18-8 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1662#L20-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1661#L18-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1658#L18-8 assume !(sep_~i~0#1 < 5); 1647#L18-9 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1642#L25-1 main_#t~ret10#1 := sep_#res#1;assume { :end_inline_sep } true;main_~ret2~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;call main_#t~mem11#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1;main_~i~2#1 := 0; 1643#L46-3 [2021-12-16 10:15:52,077 INFO L793 eck$LassoCheckResult]: Loop: 1643#L46-3 assume !!(main_~i~2#1 < 4);call main_#t~mem13#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int(main_#t~mem13#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem13#1; 1644#L46-2 main_#t~post12#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1643#L46-3 [2021-12-16 10:15:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash -866233935, now seen corresponding path program 1 times [2021-12-16 10:15:52,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:52,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38253132] [2021-12-16 10:15:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:52,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:52,168 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:52,266 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2021-12-16 10:15:52,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:52,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924597486] [2021-12-16 10:15:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:52,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:52,275 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:52,279 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:52,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:52,279 INFO L85 PathProgramCache]: Analyzing trace with hash 772846003, now seen corresponding path program 1 times [2021-12-16 10:15:52,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 10:15:52,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940602503] [2021-12-16 10:15:52,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 10:15:52,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 10:15:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:52,359 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 10:15:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 10:15:52,427 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 10:15:56,725 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 10:15:56,725 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 10:15:56,725 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 10:15:56,725 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 10:15:56,726 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 10:15:56,726 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:56,726 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 10:15:56,726 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 10:15:56,726 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration10_Lasso [2021-12-16 10:15:56,726 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 10:15:56,726 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 10:15:56,729 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-16 10:15:56,745 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-16 10:15:56,747 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-16 10:15:56,748 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-16 10:15:56,750 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-16 10:15:56,752 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-16 10:15:56,764 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-16 10:15:56,765 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-16 10:15:56,767 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-16 10:15:56,769 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-16 10:15:57,557 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-16 10:15:57,560 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-16 10:15:57,561 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-16 10:15:57,567 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-16 10:15:57,572 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-16 10:15:57,573 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-16 10:15:57,575 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-16 10:15:57,576 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-16 10:15:57,578 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-16 10:15:57,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-16 10:15:57,581 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-16 10:15:58,162 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 10:15:58,162 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 10:15:58,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,167 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-16 10:15:58,167 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-16 10:15:58,168 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-16 10:15:58,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:58,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:58,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:58,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,192 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-16 10:15:58,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,193 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-16 10:15:58,194 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-16 10:15:58,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:58,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:58,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:58,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,219 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-16 10:15:58,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,220 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-16 10:15:58,221 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-16 10:15:58,222 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-16 10:15:58,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:58,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:58,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:58,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,244 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-16 10:15:58,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,245 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-16 10:15:58,246 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-16 10:15:58,247 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-16 10:15:58,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:58,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:58,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:58,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-16 10:15:58,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,270 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-16 10:15:58,274 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-16 10:15:58,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-16 10:15:58,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:58,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:58,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:58,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,297 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-16 10:15:58,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,298 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-16 10:15:58,299 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-16 10:15:58,300 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-16 10:15:58,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:58,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:58,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:58,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:58,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,324 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-16 10:15:58,325 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-16 10:15:58,326 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-16 10:15:58,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:58,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:58,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:58,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-16 10:15:58,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,349 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-16 10:15:58,350 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-16 10:15:58,352 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-16 10:15:58,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:58,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:58,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,391 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-16 10:15:58,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,392 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-16 10:15:58,393 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-16 10:15:58,394 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-16 10:15:58,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 10:15:58,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 10:15:58,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 10:15:58,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,418 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-16 10:15:58,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,419 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-16 10:15:58,422 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-16 10:15:58,422 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-16 10:15:58,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:58,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:58,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,449 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-16 10:15:58,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,450 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-16 10:15:58,450 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-16 10:15:58,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-16 10:15:58,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:58,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:58,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,476 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-16 10:15:58,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,477 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-16 10:15:58,478 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-16 10:15:58,479 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-16 10:15:58,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:58,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:58,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-16 10:15:58,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,519 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-16 10:15:58,523 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-16 10:15:58,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:58,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:58,536 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-16 10:15:58,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-16 10:15:58,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,553 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-16 10:15:58,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:58,566 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-16 10:15:58,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:58,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:58,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,589 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-16 10:15:58,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,590 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-16 10:15:58,591 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-16 10:15:58,592 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-16 10:15:58,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:58,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:58,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-16 10:15:58,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,620 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-16 10:15:58,620 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-16 10:15:58,627 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-16 10:15:58,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:58,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:58,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,651 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-16 10:15:58,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,652 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-16 10:15:58,653 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-16 10:15:58,654 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-16 10:15:58,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:58,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:58,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 10:15:58,707 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-16 10:15:58,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,708 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-16 10:15:58,711 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-16 10:15:58,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-16 10:15:58,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 10:15:58,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 10:15:58,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 10:15:58,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 10:15:58,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 10:15:58,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 10:15:58,734 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 10:15:58,757 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2021-12-16 10:15:58,757 INFO L444 ModelExtractionUtils]: 1 out of 28 variables were initially zero. Simplification set additionally 24 variables to zero. [2021-12-16 10:15:58,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 10:15:58,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 10:15:58,763 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-16 10:15:58,763 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-16 10:15:58,764 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 10:15:58,773 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-16 10:15:58,773 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 10:15:58,773 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1) = -2*ULTIMATE.start_main_~i~2#1 + 7 Supporting invariants [] [2021-12-16 10:15:58,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:58,929 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-16 10:15:59,005 INFO L297 tatePredicateManager]: 55 out of 55 supporting invariants were superfluous and have been removed [2021-12-16 10:15:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 10:15:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:59,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 10:15:59,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:15:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 10:15:59,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 10:15:59,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 10:15:59,155 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-16 10:15:59,155 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-16 10:15:59,155 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:59,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 66 transitions. Complement of second has 4 states. [2021-12-16 10:15:59,162 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-16 10:15:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 10:15:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2021-12-16 10:15:59,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 2 letters. [2021-12-16 10:15:59,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:15:59,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 52 letters. Loop has 2 letters. [2021-12-16 10:15:59,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:15:59,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 4 letters. [2021-12-16 10:15:59,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 10:15:59,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2021-12-16 10:15:59,164 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-16 10:15:59,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2021-12-16 10:15:59,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-16 10:15:59,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-16 10:15:59,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-16 10:15:59,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 10:15:59,165 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 10:15:59,165 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 10:15:59,165 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 10:15:59,165 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-16 10:15:59,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-16 10:15:59,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-16 10:15:59,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-16 10:15:59,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.12 10:15:59 BoogieIcfgContainer [2021-12-16 10:15:59,173 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-16 10:15:59,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 10:15:59,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 10:15:59,174 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 10:15:59,174 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:15:45" (3/4) ... [2021-12-16 10:15:59,176 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-16 10:15:59,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 10:15:59,177 INFO L158 Benchmark]: Toolchain (without parser) took 14038.23ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 75.9MB in the beginning and 92.7MB in the end (delta: -16.8MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2021-12-16 10:15:59,177 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory was 48.9MB in the beginning and 48.9MB in the end (delta: 31.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 10:15:59,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.60ms. Allocated memory is still 107.0MB. Free memory was 75.6MB in the beginning and 83.4MB in the end (delta: -7.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2021-12-16 10:15:59,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.61ms. Allocated memory is still 107.0MB. Free memory was 83.4MB in the beginning and 81.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 10:15:59,178 INFO L158 Benchmark]: Boogie Preprocessor took 40.95ms. Allocated memory is still 107.0MB. Free memory was 81.3MB in the beginning and 79.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 10:15:59,179 INFO L158 Benchmark]: RCFGBuilder took 361.23ms. Allocated memory is still 107.0MB. Free memory was 79.8MB in the beginning and 67.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-16 10:15:59,179 INFO L158 Benchmark]: BuchiAutomizer took 13308.68ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 67.2MB in the beginning and 92.7MB in the end (delta: -25.5MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2021-12-16 10:15:59,179 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 157.3MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 10:15:59,181 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory was 48.9MB in the beginning and 48.9MB in the end (delta: 31.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.60ms. Allocated memory is still 107.0MB. Free memory was 75.6MB in the beginning and 83.4MB in the end (delta: -7.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.61ms. Allocated memory is still 107.0MB. Free memory was 83.4MB in the beginning and 81.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.95ms. Allocated memory is still 107.0MB. Free memory was 81.3MB in the beginning and 79.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 361.23ms. Allocated memory is still 107.0MB. Free memory was 79.8MB in the beginning and 67.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 13308.68ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 67.2MB in the beginning and 92.7MB in the end (delta: -25.5MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 157.3MB. Free memory is still 92.7MB. 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 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.2s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 12.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 660 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 268 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 238 mSDtfsCounter, 268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax100 hnf99 lsp93 ukn77 mio100 lsp39 div100 bol100 ite100 ukn100 eq172 hnf92 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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-16 10:15:59,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-12-16 10:15:59,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2021-12-16 10:15:59,824 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-16 10:16:00,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-16 10:16:00,225 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