/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:52:41,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:52:41,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:52:41,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:52:41,353 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:52:41,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:52:41,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:52:41,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:52:41,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:52:41,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:52:41,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:52:41,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:52:41,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:52:41,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:52:41,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:52:41,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:52:41,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:52:41,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:52:41,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:52:41,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:52:41,366 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:52:41,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:52:41,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:52:41,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:52:41,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:52:41,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:52:41,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:52:41,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:52:41,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:52:41,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:52:41,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:52:41,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:52:41,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:52:41,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:52:41,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:52:41,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:52:41,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:52:41,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:52:41,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:52:41,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:52:41,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:52:41,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:52:41,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-26 13:52:41,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:52:41,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:52:41,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:52:41,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:52:41,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:52:41,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:52:41,403 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:52:41,403 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:52:41,403 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:52:41,403 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:52:41,403 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:52:41,403 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:52:41,403 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:52:41,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:52:41,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:52:41,404 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:52:41,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:52:41,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:52:41,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:52:41,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:52:41,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:52:41,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:52:41,405 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:52:41,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:52:41,405 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:52:41,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:52:41,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:52:41,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:52:41,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:52:41,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:52:41,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:52:41,406 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:52:41,406 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 [2022-07-26 13:52:41,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:52:41,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:52:41,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:52:41,631 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:52:41,633 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:52:41,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c [2022-07-26 13:52:41,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a427a0be/0bd10e90742b48cc93551545c63cd18f/FLAG1ed7c98b1 [2022-07-26 13:52:42,085 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:52:42,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c [2022-07-26 13:52:42,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a427a0be/0bd10e90742b48cc93551545c63cd18f/FLAG1ed7c98b1 [2022-07-26 13:52:42,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a427a0be/0bd10e90742b48cc93551545c63cd18f [2022-07-26 13:52:42,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:52:42,109 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:52:42,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:52:42,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:52:42,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:52:42,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fda7770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42, skipping insertion in model container [2022-07-26 13:52:42,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:52:42,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:52:42,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c[2271,2284] [2022-07-26 13:52:42,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:52:42,345 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:52:42,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c[2271,2284] [2022-07-26 13:52:42,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:52:42,392 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:52:42,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42 WrapperNode [2022-07-26 13:52:42,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:52:42,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:52:42,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:52:42,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:52:42,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,433 INFO L137 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2022-07-26 13:52:42,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:52:42,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:52:42,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:52:42,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:52:42,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:52:42,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:52:42,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:52:42,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:52:42,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42" (1/1) ... [2022-07-26 13:52:42,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:42,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:42,497 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) [2022-07-26 13:52:42,498 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 [2022-07-26 13:52:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:52:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:52:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:52:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:52:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 13:52:42,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 13:52:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 13:52:42,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 13:52:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:52:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 13:52:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 13:52:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 13:52:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:52:42,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:52:42,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:52:42,527 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 13:52:42,584 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:52:42,586 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:52:42,814 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:52:42,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:52:42,886 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-26 13:52:42,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:52:42 BoogieIcfgContainer [2022-07-26 13:52:42,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:52:42,894 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:52:42,894 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:52:42,897 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:52:42,898 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:52:42,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:52:42" (1/3) ... [2022-07-26 13:52:42,898 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@213fec08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:52:42, skipping insertion in model container [2022-07-26 13:52:42,898 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:52:42,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:52:42" (2/3) ... [2022-07-26 13:52:42,899 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@213fec08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:52:42, skipping insertion in model container [2022-07-26 13:52:42,899 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:52:42,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:52:42" (3/3) ... [2022-07-26 13:52:42,900 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-bad-counter-queue2.wvr.c [2022-07-26 13:52:42,978 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 13:52:43,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 116 transitions, 248 flow [2022-07-26 13:52:43,044 INFO L129 PetriNetUnfolder]: 9/112 cut-off events. [2022-07-26 13:52:43,044 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:52:43,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 112 events. 9/112 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-07-26 13:52:43,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 116 transitions, 248 flow [2022-07-26 13:52:43,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 112 transitions, 236 flow [2022-07-26 13:52:43,058 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-26 13:52:43,067 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 112 transitions, 236 flow [2022-07-26 13:52:43,069 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 112 transitions, 236 flow [2022-07-26 13:52:43,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 112 transitions, 236 flow [2022-07-26 13:52:43,096 INFO L129 PetriNetUnfolder]: 9/112 cut-off events. [2022-07-26 13:52:43,096 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:52:43,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 112 events. 9/112 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-07-26 13:52:43,099 INFO L116 LiptonReduction]: Number of co-enabled transitions 500 [2022-07-26 13:52:46,514 INFO L131 LiptonReduction]: Checked pairs total: 565 [2022-07-26 13:52:46,514 INFO L133 LiptonReduction]: Total number of compositions: 110 [2022-07-26 13:52:46,526 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:52:46,526 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:52:46,526 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:52:46,526 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:52:46,527 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:52:46,527 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:52:46,527 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:52:46,527 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:52:46,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:52:46,546 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-26 13:52:46,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:52:46,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:52:46,550 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 13:52:46,550 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:52:46,550 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:52:46,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 34 states, but on-demand construction may add more states [2022-07-26 13:52:46,552 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-26 13:52:46,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:52:46,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:52:46,553 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 13:52:46,553 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:52:46,556 INFO L733 eck$LassoCheckResult]: Stem: 115#[ULTIMATE.startENTRY]don't care [533] ULTIMATE.startENTRY-->L91-6: Formula: (let ((.cse2 (store |v_#valid_190| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1)) (.cse1 (select |v_#memory_int_117| 1))) (and (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 1) |v_#valid_189|) (= 48 (select .cse1 0)) (= v_~A~0.offset_67 0) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_190| 2) 1) (= (store (store (store |v_#length_151| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_150|) (= |v_#NULL.base_12| 0) (= v_~A~0.base_67 0) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select |v_#valid_190| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) 0) (= (select |v_#valid_190| 0) 0) (= v_~counter~0_135 0) (< 0 |v_#StackHeapBarrier_37|) (= 32 (select |v_#length_151| 2)) (= 2 (select |v_#length_151| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_64) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43| 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= (select .cse1 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (= |v_#NULL.offset_12| 0) (= (select |v_#valid_190| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| |v_#StackHeapBarrier_37|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_37|, #valid=|v_#valid_190|, #memory_int=|v_#memory_int_117|, #length=|v_#length_151|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~A~0.base=v_~A~0.base_67, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_33|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_25|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_30|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_36|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, #length=|v_#length_150|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_48|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_31|, ~counter~0=v_~counter~0_135, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_64, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_33|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #StackHeapBarrier=|v_#StackHeapBarrier_37|, ~A~0.offset=v_~A~0.offset_67, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_26|, #memory_int=|v_#memory_int_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 118#[L91-6]don't care [2022-07-26 13:52:46,556 INFO L735 eck$LassoCheckResult]: Loop: 118#[L91-6]don't care [516] L91-6-->L91-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|) (= (store |v_#memory_int_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_21|)) |v_#memory_int_101|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 1)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_102|, #length=|v_#length_122|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_15|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_101|, #length=|v_#length_122|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 118#[L91-6]don't care [2022-07-26 13:52:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:46,559 INFO L85 PathProgramCache]: Analyzing trace with hash 564, now seen corresponding path program 1 times [2022-07-26 13:52:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:46,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626291469] [2022-07-26 13:52:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:46,632 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:46,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:46,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:46,665 INFO L85 PathProgramCache]: Analyzing trace with hash 547, now seen corresponding path program 1 times [2022-07-26 13:52:46,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:46,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294754827] [2022-07-26 13:52:46,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:46,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:46,673 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:46,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash 18000, now seen corresponding path program 1 times [2022-07-26 13:52:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:46,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413731064] [2022-07-26 13:52:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:46,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:46,696 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:46,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:47,037 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:52:47,038 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:52:47,038 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:52:47,038 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:52:47,038 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:52:47,038 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:47,038 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:52:47,038 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:52:47,038 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue2.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 13:52:47,038 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:52:47,038 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:52:47,053 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,058 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,059 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,060 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,062 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,064 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,065 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,067 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,069 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,072 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,077 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,079 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,080 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,082 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,084 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,306 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,307 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,309 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,311 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,312 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,315 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,317 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,318 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,320 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,322 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,323 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,325 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,327 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:47,655 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:52:47,658 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:52:47,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:47,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:47,660 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) [2022-07-26 13:52:47,661 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 [2022-07-26 13:52:47,663 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 [2022-07-26 13:52:47,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:47,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:47,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:47,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:47,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:47,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:47,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:47,696 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 [2022-07-26 13:52:47,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:47,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:47,697 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) [2022-07-26 13:52:47,698 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 [2022-07-26 13:52:47,699 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 [2022-07-26 13:52:47,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:47,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:47,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:47,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:47,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:47,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:47,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:47,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:47,743 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 [2022-07-26 13:52:47,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:47,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:47,744 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) [2022-07-26 13:52:47,756 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 [2022-07-26 13:52:47,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:52:47,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:47,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:47,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:47,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:47,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:47,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:47,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:47,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:47,791 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 [2022-07-26 13:52:47,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:47,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:47,792 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) [2022-07-26 13:52:47,793 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 [2022-07-26 13:52:47,794 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 [2022-07-26 13:52:47,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:47,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:47,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:47,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:47,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:47,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:47,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:47,822 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 [2022-07-26 13:52:47,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:47,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:47,827 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) [2022-07-26 13:52:47,839 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 [2022-07-26 13:52:47,840 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 [2022-07-26 13:52:47,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:47,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:47,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:47,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:47,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:47,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:47,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:47,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:47,878 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 [2022-07-26 13:52:47,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:47,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:47,880 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) [2022-07-26 13:52:47,881 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 [2022-07-26 13:52:47,882 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 [2022-07-26 13:52:47,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:47,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:47,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:47,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:47,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:47,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:47,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:47,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:47,910 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 [2022-07-26 13:52:47,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:47,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:47,911 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) [2022-07-26 13:52:47,912 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 [2022-07-26 13:52:47,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:52:47,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:47,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:47,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:47,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:47,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:47,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:47,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:47,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:47,934 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 [2022-07-26 13:52:47,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:47,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:47,935 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) [2022-07-26 13:52:47,936 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 [2022-07-26 13:52:47,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:52:47,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:47,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:47,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:47,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:47,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:47,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:47,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:47,974 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 [2022-07-26 13:52:47,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:47,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:47,976 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:47,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-26 13:52:47,977 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 [2022-07-26 13:52:47,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:47,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:47,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:47,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:47,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:47,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:47,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:47,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:48,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,007 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:48,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-26 13:52:48,009 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 [2022-07-26 13:52:48,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:48,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:48,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:48,026 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:48,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,042 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) [2022-07-26 13:52:48,043 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 [2022-07-26 13:52:48,044 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 [2022-07-26 13:52:48,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,073 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 [2022-07-26 13:52:48,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,074 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) [2022-07-26 13:52:48,075 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 [2022-07-26 13:52:48,077 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 [2022-07-26 13:52:48,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,109 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 [2022-07-26 13:52:48,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,110 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) [2022-07-26 13:52:48,111 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 [2022-07-26 13:52:48,112 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 [2022-07-26 13:52:48,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:48,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:48,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:48,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,142 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 [2022-07-26 13:52:48,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,143 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) [2022-07-26 13:52:48,144 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 [2022-07-26 13:52:48,146 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 [2022-07-26 13:52:48,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,171 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 [2022-07-26 13:52:48,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,172 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) [2022-07-26 13:52:48,173 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 [2022-07-26 13:52:48,174 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 [2022-07-26 13:52:48,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,214 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 [2022-07-26 13:52:48,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,216 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) [2022-07-26 13:52:48,218 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 [2022-07-26 13:52:48,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:52:48,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,251 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 [2022-07-26 13:52:48,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,253 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) [2022-07-26 13:52:48,254 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 [2022-07-26 13:52:48,256 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 [2022-07-26 13:52:48,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,293 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 [2022-07-26 13:52:48,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,295 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) [2022-07-26 13:52:48,296 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 [2022-07-26 13:52:48,297 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 [2022-07-26 13:52:48,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:48,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:48,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:48,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,318 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 [2022-07-26 13:52:48,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,319 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) [2022-07-26 13:52:48,321 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 [2022-07-26 13:52:48,322 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 [2022-07-26 13:52:48,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,371 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 [2022-07-26 13:52:48,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,373 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) [2022-07-26 13:52:48,378 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 [2022-07-26 13:52:48,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,387 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 [2022-07-26 13:52:48,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,420 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 [2022-07-26 13:52:48,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,422 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) [2022-07-26 13:52:48,423 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 [2022-07-26 13:52:48,424 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 [2022-07-26 13:52:48,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-26 13:52:48,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,458 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) [2022-07-26 13:52:48,459 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 [2022-07-26 13:52:48,460 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 [2022-07-26 13:52:48,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-26 13:52:48,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,487 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) [2022-07-26 13:52:48,487 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 [2022-07-26 13:52:48,489 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 [2022-07-26 13:52:48,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:48,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:48,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,518 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) [2022-07-26 13:52:48,518 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 [2022-07-26 13:52:48,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:52:48,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:48,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:48,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:48,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:48,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:48,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:48,539 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:52:48,593 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-26 13:52:48,593 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-26 13:52:48,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:48,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:48,612 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) [2022-07-26 13:52:48,651 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 [2022-07-26 13:52:48,652 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:52:48,670 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:52:48,670 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:52:48,671 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-26 13:52:48,690 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 [2022-07-26 13:52:48,722 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-26 13:52:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:52:48,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:52:48,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:52:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:52:48,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 13:52:48,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:52:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:52:48,818 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 13:52:48,820 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 34 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2022-07-26 13:52:48,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 34 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 68 states and 150 transitions. Complement of second has 5 states. [2022-07-26 13:52:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 13:52:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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) [2022-07-26 13:52:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-07-26 13:52:48,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 13:52:48,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:52:48,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 13:52:48,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:52:48,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 13:52:48,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:52:48,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 150 transitions. [2022-07-26 13:52:48,890 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 13:52:48,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 30 states and 66 transitions. [2022-07-26 13:52:48,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-26 13:52:48,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-26 13:52:48,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 66 transitions. [2022-07-26 13:52:48,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:52:48,895 INFO L220 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-26 13:52:48,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 66 transitions. [2022-07-26 13:52:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-26 13:52:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 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) [2022-07-26 13:52:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 66 transitions. [2022-07-26 13:52:48,915 INFO L242 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-26 13:52:48,915 INFO L426 stractBuchiCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-26 13:52:48,915 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:52:48,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 66 transitions. [2022-07-26 13:52:48,917 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-26 13:52:48,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:52:48,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:52:48,918 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 13:52:48,918 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:52:48,919 INFO L733 eck$LassoCheckResult]: Stem: 371#[ULTIMATE.startENTRY]don't care [533] ULTIMATE.startENTRY-->L91-6: Formula: (let ((.cse2 (store |v_#valid_190| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1)) (.cse1 (select |v_#memory_int_117| 1))) (and (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 1) |v_#valid_189|) (= 48 (select .cse1 0)) (= v_~A~0.offset_67 0) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_190| 2) 1) (= (store (store (store |v_#length_151| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_150|) (= |v_#NULL.base_12| 0) (= v_~A~0.base_67 0) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select |v_#valid_190| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) 0) (= (select |v_#valid_190| 0) 0) (= v_~counter~0_135 0) (< 0 |v_#StackHeapBarrier_37|) (= 32 (select |v_#length_151| 2)) (= 2 (select |v_#length_151| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_64) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43| 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= (select .cse1 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (= |v_#NULL.offset_12| 0) (= (select |v_#valid_190| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| |v_#StackHeapBarrier_37|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_37|, #valid=|v_#valid_190|, #memory_int=|v_#memory_int_117|, #length=|v_#length_151|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~A~0.base=v_~A~0.base_67, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_33|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_25|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_30|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_36|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, #length=|v_#length_150|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_48|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_31|, ~counter~0=v_~counter~0_135, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_64, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_33|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #StackHeapBarrier=|v_#StackHeapBarrier_37|, ~A~0.offset=v_~A~0.offset_67, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_26|, #memory_int=|v_#memory_int_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 373#[L91-6]don't care [523] L91-6-->L75-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~A~0.base_63) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_132| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_main_#t~pre9#1_27| |v_#pthreadsForks_36|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre9#1_27|))) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~A~0.offset_63) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_161| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, #valid=|v_#valid_161|, #memory_int=|v_#memory_int_112|, #length=|v_#length_132|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{~A~0.base=v_~A~0.base_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_25|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, ~A~0.offset=v_~A~0.offset_63, #pthreadsForks=|v_#pthreadsForks_35|, #valid=|v_#valid_161|, #memory_int=|v_#memory_int_111|, #length=|v_#length_132|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 363#[L75-3]don't care [421] L75-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 365#[L75-4, thread1ENTRY]don't care [396] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 389#[L75-4, L49-4]don't care [2022-07-26 13:52:48,921 INFO L735 eck$LassoCheckResult]: Loop: 389#[L75-4, L49-4]don't care [514] L49-4-->L49-4: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork1_~i~0#1_46| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_57)) (.cse2 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_21| |v_thread1Thread1of1ForFork1_plus_~b#1_21|))) (and (= |v_thread1Thread1of1ForFork1_plus_~a#1_21| |v_thread1Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_21| (select (select |v_#memory_int_99| v_~A~0.base_57) .cse0)) (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_57 4) (select |v_#length_120| v_~A~0.base_57)) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_21| |v_thread1Thread1of1ForFork1_plus_~b#1_21| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_21|)) 1 0) 0)) (= v_~counter~0_120 |v_thread1Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_21| v_~counter~0_119) (< |v_thread1Thread1of1ForFork1_~i~0#1_46| v_~N~0_50) (= |v_thread1Thread1of1ForFork1_plus_~b#1_21| |v_thread1Thread1of1ForFork1_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21| (ite (or (<= .cse2 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_21| 0)) 1 0)) (= |v_thread1Thread1of1ForFork1_plus_#res#1_21| .cse2) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (select |v_#valid_147| v_~A~0.base_57) 1) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_46| 1) |v_thread1Thread1of1ForFork1_~i~0#1_45|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|)))) InVars {~counter~0=v_~counter~0_120, ~A~0.base=v_~A~0.base_57, ~A~0.offset=v_~A~0.offset_57, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_46|, #valid=|v_#valid_147|, #memory_int=|v_#memory_int_99|, #length=|v_#length_120|, ~N~0=v_~N~0_50} OutVars{~counter~0=v_~counter~0_119, ~A~0.base=v_~A~0.base_57, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_21|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_21|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_21|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_21|, ~N~0=v_~N~0_50, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_17|, ~A~0.offset=v_~A~0.offset_57, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_45|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, #valid=|v_#valid_147|, #memory_int=|v_#memory_int_99|, #length=|v_#length_120|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_21|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_21|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_21|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 389#[L75-4, L49-4]don't care [2022-07-26 13:52:48,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash 17318174, now seen corresponding path program 1 times [2022-07-26 13:52:48,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:48,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640582156] [2022-07-26 13:52:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:48,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:48,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:48,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash 545, now seen corresponding path program 1 times [2022-07-26 13:52:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:48,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739336929] [2022-07-26 13:52:48,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:48,997 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:49,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash 536863908, now seen corresponding path program 1 times [2022-07-26 13:52:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:49,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565278395] [2022-07-26 13:52:49,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:49,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:52:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:52:49,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:52:49,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565278395] [2022-07-26 13:52:49,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565278395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:52:49,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:52:49,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:52:49,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995330029] [2022-07-26 13:52:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:52:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:52:49,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 13:52:49,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-26 13:52:49,186 INFO L87 Difference]: Start difference. First operand 30 states and 66 transitions. cyclomatic complexity: 51 Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:52:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:52:49,250 INFO L93 Difference]: Finished difference Result 57 states and 119 transitions. [2022-07-26 13:52:49,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 119 transitions. [2022-07-26 13:52:49,251 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 22 [2022-07-26 13:52:49,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 53 states and 111 transitions. [2022-07-26 13:52:49,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-07-26 13:52:49,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-07-26 13:52:49,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 111 transitions. [2022-07-26 13:52:49,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:52:49,252 INFO L220 hiAutomatonCegarLoop]: Abstraction has 53 states and 111 transitions. [2022-07-26 13:52:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 111 transitions. [2022-07-26 13:52:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-07-26 13:52:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 42 states have internal predecessors, (95), 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) [2022-07-26 13:52:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 95 transitions. [2022-07-26 13:52:49,255 INFO L242 hiAutomatonCegarLoop]: Abstraction has 43 states and 95 transitions. [2022-07-26 13:52:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 13:52:49,256 INFO L426 stractBuchiCegarLoop]: Abstraction has 43 states and 95 transitions. [2022-07-26 13:52:49,256 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:52:49,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 95 transitions. [2022-07-26 13:52:49,257 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 18 [2022-07-26 13:52:49,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:52:49,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:52:49,257 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 13:52:49,257 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:52:49,257 INFO L733 eck$LassoCheckResult]: Stem: 508#[ULTIMATE.startENTRY]don't care [533] ULTIMATE.startENTRY-->L91-6: Formula: (let ((.cse2 (store |v_#valid_190| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1)) (.cse1 (select |v_#memory_int_117| 1))) (and (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 1) |v_#valid_189|) (= 48 (select .cse1 0)) (= v_~A~0.offset_67 0) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_190| 2) 1) (= (store (store (store |v_#length_151| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_150|) (= |v_#NULL.base_12| 0) (= v_~A~0.base_67 0) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select |v_#valid_190| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) 0) (= (select |v_#valid_190| 0) 0) (= v_~counter~0_135 0) (< 0 |v_#StackHeapBarrier_37|) (= 32 (select |v_#length_151| 2)) (= 2 (select |v_#length_151| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_64) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43| 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= (select .cse1 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (= |v_#NULL.offset_12| 0) (= (select |v_#valid_190| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| |v_#StackHeapBarrier_37|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_37|, #valid=|v_#valid_190|, #memory_int=|v_#memory_int_117|, #length=|v_#length_151|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~A~0.base=v_~A~0.base_67, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_33|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_25|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_30|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_36|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, #length=|v_#length_150|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_48|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_31|, ~counter~0=v_~counter~0_135, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_64, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_33|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #StackHeapBarrier=|v_#StackHeapBarrier_37|, ~A~0.offset=v_~A~0.offset_67, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_26|, #memory_int=|v_#memory_int_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 510#[L91-6]don't care [516] L91-6-->L91-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|) (= (store |v_#memory_int_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_21|)) |v_#memory_int_101|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 1)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_102|, #length=|v_#length_122|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_15|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_101|, #length=|v_#length_122|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 514#[L91-6]don't care [523] L91-6-->L75-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~A~0.base_63) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_132| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_main_#t~pre9#1_27| |v_#pthreadsForks_36|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre9#1_27|))) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~A~0.offset_63) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_161| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, #valid=|v_#valid_161|, #memory_int=|v_#memory_int_112|, #length=|v_#length_132|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{~A~0.base=v_~A~0.base_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_25|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, ~A~0.offset=v_~A~0.offset_63, #pthreadsForks=|v_#pthreadsForks_35|, #valid=|v_#valid_161|, #memory_int=|v_#memory_int_111|, #length=|v_#length_132|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 516#[L75-3]don't care [421] L75-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 550#[L75-4, thread1ENTRY]don't care [396] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 526#[L75-4, L49-4]don't care [2022-07-26 13:52:49,258 INFO L735 eck$LassoCheckResult]: Loop: 526#[L75-4, L49-4]don't care [514] L49-4-->L49-4: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork1_~i~0#1_46| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_57)) (.cse2 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_21| |v_thread1Thread1of1ForFork1_plus_~b#1_21|))) (and (= |v_thread1Thread1of1ForFork1_plus_~a#1_21| |v_thread1Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_21| (select (select |v_#memory_int_99| v_~A~0.base_57) .cse0)) (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_57 4) (select |v_#length_120| v_~A~0.base_57)) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_21| |v_thread1Thread1of1ForFork1_plus_~b#1_21| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_21|)) 1 0) 0)) (= v_~counter~0_120 |v_thread1Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_21| v_~counter~0_119) (< |v_thread1Thread1of1ForFork1_~i~0#1_46| v_~N~0_50) (= |v_thread1Thread1of1ForFork1_plus_~b#1_21| |v_thread1Thread1of1ForFork1_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21| (ite (or (<= .cse2 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_21| 0)) 1 0)) (= |v_thread1Thread1of1ForFork1_plus_#res#1_21| .cse2) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (select |v_#valid_147| v_~A~0.base_57) 1) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_46| 1) |v_thread1Thread1of1ForFork1_~i~0#1_45|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|)))) InVars {~counter~0=v_~counter~0_120, ~A~0.base=v_~A~0.base_57, ~A~0.offset=v_~A~0.offset_57, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_46|, #valid=|v_#valid_147|, #memory_int=|v_#memory_int_99|, #length=|v_#length_120|, ~N~0=v_~N~0_50} OutVars{~counter~0=v_~counter~0_119, ~A~0.base=v_~A~0.base_57, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_21|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_21|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_21|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_21|, ~N~0=v_~N~0_50, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_17|, ~A~0.offset=v_~A~0.offset_57, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_45|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, #valid=|v_#valid_147|, #memory_int=|v_#memory_int_99|, #length=|v_#length_120|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_21|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_21|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_21|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 526#[L75-4, L49-4]don't care [2022-07-26 13:52:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash 536754050, now seen corresponding path program 1 times [2022-07-26 13:52:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:49,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219461287] [2022-07-26 13:52:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:49,272 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:49,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash 545, now seen corresponding path program 2 times [2022-07-26 13:52:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:49,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884085503] [2022-07-26 13:52:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:49,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:49,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:49,306 INFO L85 PathProgramCache]: Analyzing trace with hash -540493120, now seen corresponding path program 1 times [2022-07-26 13:52:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:49,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626535133] [2022-07-26 13:52:49,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:49,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:49,351 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:49,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:49,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:50,127 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:52:50,127 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:52:50,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:52:50,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:52:50,128 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:52:50,128 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:50,128 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:52:50,128 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:52:50,128 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue2.wvr.c_BEv2_Iteration3_Lasso [2022-07-26 13:52:50,128 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:52:50,128 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:52:50,134 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,139 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,140 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,142 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,144 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,145 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,147 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,148 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,150 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,151 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,152 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,154 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,156 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,157 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,159 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,161 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,162 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,164 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,167 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,169 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,171 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,172 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,174 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,176 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,179 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,182 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,183 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,661 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:50,664 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:51,267 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:52:51,267 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:52:51,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,270 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) [2022-07-26 13:52:51,271 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 [2022-07-26 13:52:51,272 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 [2022-07-26 13:52:51,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,293 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 [2022-07-26 13:52:51,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,294 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) [2022-07-26 13:52:51,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:52:51,302 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 [2022-07-26 13:52:51,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,331 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 [2022-07-26 13:52:51,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,332 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) [2022-07-26 13:52:51,333 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 [2022-07-26 13:52:51,335 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 [2022-07-26 13:52:51,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-26 13:52:51,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,366 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) [2022-07-26 13:52:51,366 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 [2022-07-26 13:52:51,367 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 [2022-07-26 13:52:51,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:51,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:51,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-26 13:52:51,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,392 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) [2022-07-26 13:52:51,392 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 [2022-07-26 13:52:51,393 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 [2022-07-26 13:52:51,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,415 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 [2022-07-26 13:52:51,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,418 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) [2022-07-26 13:52:51,420 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 [2022-07-26 13:52:51,420 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 [2022-07-26 13:52:51,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:51,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,448 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) [2022-07-26 13:52:51,449 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 [2022-07-26 13:52:51,450 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 [2022-07-26 13:52:51,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-26 13:52:51,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,472 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:51,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-26 13:52:51,474 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 [2022-07-26 13:52:51,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-26 13:52:51,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,496 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:51,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-26 13:52:51,499 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 [2022-07-26 13:52:51,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:51,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,537 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:51,540 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 [2022-07-26 13:52:51,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-26 13:52:51,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-26 13:52:51,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,583 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) [2022-07-26 13:52:51,584 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 [2022-07-26 13:52:51,585 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 [2022-07-26 13:52:51,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:51,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:51,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-26 13:52:51,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,609 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) [2022-07-26 13:52:51,615 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 [2022-07-26 13:52:51,615 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 [2022-07-26 13:52:51,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-26 13:52:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,638 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) [2022-07-26 13:52:51,638 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 [2022-07-26 13:52:51,640 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 [2022-07-26 13:52:51,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-26 13:52:51,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,662 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) [2022-07-26 13:52:51,665 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 [2022-07-26 13:52:51,666 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 [2022-07-26 13:52:51,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:51,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:51,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,694 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 [2022-07-26 13:52:51,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,695 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) [2022-07-26 13:52:51,696 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 [2022-07-26 13:52:51,697 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 [2022-07-26 13:52:51,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:51,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:51,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,720 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 [2022-07-26 13:52:51,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,721 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) [2022-07-26 13:52:51,722 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 [2022-07-26 13:52:51,723 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 [2022-07-26 13:52:51,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,746 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 [2022-07-26 13:52:51,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,748 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) [2022-07-26 13:52:51,749 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 [2022-07-26 13:52:51,751 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 [2022-07-26 13:52:51,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:51,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:51,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,783 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 [2022-07-26 13:52:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,785 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) [2022-07-26 13:52:51,786 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 [2022-07-26 13:52:51,787 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 [2022-07-26 13:52:51,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,808 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 [2022-07-26 13:52:51,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,809 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) [2022-07-26 13:52:51,809 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 [2022-07-26 13:52:51,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 [2022-07-26 13:52:51,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-26 13:52:51,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,833 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) [2022-07-26 13:52:51,834 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 [2022-07-26 13:52:51,836 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 [2022-07-26 13:52:51,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:51,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:51,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,868 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 [2022-07-26 13:52:51,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,869 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) [2022-07-26 13:52:51,870 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 [2022-07-26 13:52:51,871 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 [2022-07-26 13:52:51,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-26 13:52:51,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,893 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) [2022-07-26 13:52:51,893 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 [2022-07-26 13:52:51,894 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 [2022-07-26 13:52:51,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:51,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:51,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:51,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,929 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) [2022-07-26 13:52:51,930 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 [2022-07-26 13:52:51,931 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 [2022-07-26 13:52:51,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:51,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:51,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:51,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:51,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,962 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) [2022-07-26 13:52:51,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-26 13:52:51,964 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 [2022-07-26 13:52:51,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:51,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:51,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:51,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-26 13:52:51,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:51,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:51,988 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) [2022-07-26 13:52:51,988 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 [2022-07-26 13:52:51,989 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 [2022-07-26 13:52:51,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:51,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:51,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:51,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:51,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:51,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:51,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:52,014 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 [2022-07-26 13:52:52,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:52,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:52,015 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) [2022-07-26 13:52:52,016 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 [2022-07-26 13:52:52,017 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 [2022-07-26 13:52:52,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:52,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:52,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:52,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:52,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:52,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:52,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:52,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:52,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-26 13:52:52,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:52,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:52,054 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) [2022-07-26 13:52:52,055 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 [2022-07-26 13:52:52,056 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 [2022-07-26 13:52:52,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:52,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:52,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:52,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:52,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:52,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:52,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:52,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-26 13:52:52,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:52,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:52,083 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) [2022-07-26 13:52:52,084 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 [2022-07-26 13:52:52,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:52:52,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:52,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:52,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:52,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:52,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:52,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:52,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:52,118 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 [2022-07-26 13:52:52,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:52,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:52,119 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) [2022-07-26 13:52:52,120 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 [2022-07-26 13:52:52,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 [2022-07-26 13:52:52,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:52,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:52,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:52,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:52,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:52,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:52,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:52,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-26 13:52:52,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:52,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:52,152 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:52,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-26 13:52:52,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:52:52,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:52,159 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 13:52:52,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:52,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:52,162 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 13:52:52,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:52,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:52,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:52,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:52,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:52,195 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:52,200 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 [2022-07-26 13:52:52,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-26 13:52:52,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:52,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:52,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:52,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:52,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:52,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:52,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:52,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-26 13:52:52,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:52,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:52,224 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:52,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-26 13:52:52,226 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 [2022-07-26 13:52:52,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:52,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:52,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:52,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:52,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:52,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:52,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:52,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:52,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:52,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:52,259 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:52,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-26 13:52:52,262 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 [2022-07-26 13:52:52,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:52,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:52,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:52,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:52,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:52,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:52,295 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:52:52,327 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-07-26 13:52:52,327 INFO L444 ModelExtractionUtils]: 13 out of 37 variables were initially zero. Simplification set additionally 20 variables to zero. [2022-07-26 13:52:52,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:52,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:52,328 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:52,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-26 13:52:52,330 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:52:52,336 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 13:52:52,336 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:52:52,336 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_2, thread1Thread1of1ForFork1_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_2 - 4*thread1Thread1of1ForFork1_~i~0#1 Supporting invariants [1*~A~0.offset >= 0] [2022-07-26 13:52:52,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:52,409 INFO L156 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2022-07-26 13:52:52,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:52:52,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-26 13:52:52,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:52:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:52:52,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-26 13:52:52,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:52:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:52:52,479 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2022-07-26 13:52:52,480 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 95 transitions. cyclomatic complexity: 71 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:52:52,529 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 95 transitions. cyclomatic complexity: 71. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 277 transitions. Complement of second has 6 states. [2022-07-26 13:52:52,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 13:52:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:52:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-07-26 13:52:52,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-26 13:52:52,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:52:52,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-26 13:52:52,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:52:52,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-26 13:52:52,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:52:52,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 277 transitions. [2022-07-26 13:52:52,532 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-26 13:52:52,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 73 states and 186 transitions. [2022-07-26 13:52:52,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-26 13:52:52,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2022-07-26 13:52:52,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 186 transitions. [2022-07-26 13:52:52,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:52:52,533 INFO L220 hiAutomatonCegarLoop]: Abstraction has 73 states and 186 transitions. [2022-07-26 13:52:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 186 transitions. [2022-07-26 13:52:52,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2022-07-26 13:52:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.66) internal successors, (133), 49 states have internal predecessors, (133), 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) [2022-07-26 13:52:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 133 transitions. [2022-07-26 13:52:52,548 INFO L242 hiAutomatonCegarLoop]: Abstraction has 50 states and 133 transitions. [2022-07-26 13:52:52,548 INFO L426 stractBuchiCegarLoop]: Abstraction has 50 states and 133 transitions. [2022-07-26 13:52:52,548 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 13:52:52,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 133 transitions. [2022-07-26 13:52:52,549 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-26 13:52:52,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:52:52,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:52:52,549 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:52:52,549 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:52:52,550 INFO L733 eck$LassoCheckResult]: Stem: 845#[ULTIMATE.startENTRY]don't care [533] ULTIMATE.startENTRY-->L91-6: Formula: (let ((.cse2 (store |v_#valid_190| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1)) (.cse1 (select |v_#memory_int_117| 1))) (and (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 1) |v_#valid_189|) (= 48 (select .cse1 0)) (= v_~A~0.offset_67 0) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_190| 2) 1) (= (store (store (store |v_#length_151| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_150|) (= |v_#NULL.base_12| 0) (= v_~A~0.base_67 0) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select |v_#valid_190| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) 0) (= (select |v_#valid_190| 0) 0) (= v_~counter~0_135 0) (< 0 |v_#StackHeapBarrier_37|) (= 32 (select |v_#length_151| 2)) (= 2 (select |v_#length_151| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_64) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43| 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= (select .cse1 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (= |v_#NULL.offset_12| 0) (= (select |v_#valid_190| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| |v_#StackHeapBarrier_37|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_37|, #valid=|v_#valid_190|, #memory_int=|v_#memory_int_117|, #length=|v_#length_151|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~A~0.base=v_~A~0.base_67, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_33|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_25|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_30|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_36|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, #length=|v_#length_150|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_48|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_31|, ~counter~0=v_~counter~0_135, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_64, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_33|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #StackHeapBarrier=|v_#StackHeapBarrier_37|, ~A~0.offset=v_~A~0.offset_67, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_26|, #memory_int=|v_#memory_int_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 847#[L91-6]don't care [523] L91-6-->L75-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~A~0.base_63) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_132| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_main_#t~pre9#1_27| |v_#pthreadsForks_36|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre9#1_27|))) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~A~0.offset_63) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_161| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, #valid=|v_#valid_161|, #memory_int=|v_#memory_int_112|, #length=|v_#length_132|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{~A~0.base=v_~A~0.base_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_25|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, ~A~0.offset=v_~A~0.offset_63, #pthreadsForks=|v_#pthreadsForks_35|, #valid=|v_#valid_161|, #memory_int=|v_#memory_int_111|, #length=|v_#length_132|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 853#[L75-3]don't care [421] L75-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 865#[L75-4, thread1ENTRY]don't care [508] L75-4-->L76-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_127| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre11#1_21|)) |v_#memory_int_85|) (= |v_ULTIMATE.start_main_#t~pre11#1_21| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_104| |v_ULTIMATE.start_main_~#t2~0#1.base_31|))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_86|, #length=|v_#length_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_85|, #length=|v_#length_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int] 807#[L76-3, thread1ENTRY]don't care [418] L76-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_14|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_8|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~ret6#1] 809#[thread1ENTRY, thread2ENTRY, L76-4]don't care [406] thread2ENTRY-->L59-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 841#[thread1ENTRY, L59-4, L76-4]don't care [2022-07-26 13:52:52,550 INFO L735 eck$LassoCheckResult]: Loop: 841#[thread1ENTRY, L59-4, L76-4]don't care [507] L59-4-->L59-4: Formula: (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_38| 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_51))) (and (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_15| |v_thread2Thread1of1ForFork0_minus_~a#1_15|) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_15| 0) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_15| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_15|))) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_15| v_~counter~0_110) (< |v_thread2Thread1of1ForFork0_~i~1#1_38| v_~N~0_44) (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~a#1_15| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_15|)) (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_15|)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_15|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_15| |v_thread2Thread1of1ForFork0_minus_~b#1_15|) (= (+ |v_thread2Thread1of1ForFork0_minus_~a#1_15| (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_15|)) |v_thread2Thread1of1ForFork0_minus_#res#1_15|) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_38| 1) |v_thread2Thread1of1ForFork0_~i~1#1_37|) (<= (+ .cse0 v_~A~0.offset_51 4) (select |v_#length_102| v_~A~0.base_51)) (<= 0 .cse1) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_15| (select (select |v_#memory_int_83| v_~A~0.base_51) .cse1)) (= v_~counter~0_109 |v_thread2Thread1of1ForFork0_minus_#res#1_15|) (= (select |v_#valid_125| v_~A~0.base_51) 1)))) InVars {~counter~0=v_~counter~0_110, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_83|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_38|, #length=|v_#length_102|, ~N~0=v_~N~0_44} OutVars{~counter~0=v_~counter~0_109, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_15|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_15|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_37|, ~N~0=v_~N~0_44, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_15|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_15|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_15|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_83|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_15|, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_15|, #length=|v_#length_102|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_15|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_15|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~ret6#1] 841#[thread1ENTRY, L59-4, L76-4]don't care [2022-07-26 13:52:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash -536982974, now seen corresponding path program 1 times [2022-07-26 13:52:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:52,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490795662] [2022-07-26 13:52:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:52,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:52,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:52,569 INFO L85 PathProgramCache]: Analyzing trace with hash 538, now seen corresponding path program 1 times [2022-07-26 13:52:52,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:52,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637108217] [2022-07-26 13:52:52,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:52,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:52,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:52,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:52,578 INFO L85 PathProgramCache]: Analyzing trace with hash 533397497, now seen corresponding path program 1 times [2022-07-26 13:52:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:52,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005143535] [2022-07-26 13:52:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:52,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:52:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:52:52,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:52:52,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005143535] [2022-07-26 13:52:52,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005143535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:52:52,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:52:52,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:52:52,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837380068] [2022-07-26 13:52:52,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:52:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:52:52,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 13:52:52,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-26 13:52:52,730 INFO L87 Difference]: Start difference. First operand 50 states and 133 transitions. cyclomatic complexity: 100 Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:52:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:52:52,776 INFO L93 Difference]: Finished difference Result 65 states and 153 transitions. [2022-07-26 13:52:52,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 153 transitions. [2022-07-26 13:52:52,777 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-26 13:52:52,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 42 states and 115 transitions. [2022-07-26 13:52:52,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-26 13:52:52,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-26 13:52:52,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 115 transitions. [2022-07-26 13:52:52,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:52:52,778 INFO L220 hiAutomatonCegarLoop]: Abstraction has 42 states and 115 transitions. [2022-07-26 13:52:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 115 transitions. [2022-07-26 13:52:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-26 13:52:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.738095238095238) internal successors, (115), 41 states have internal predecessors, (115), 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) [2022-07-26 13:52:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 115 transitions. [2022-07-26 13:52:52,780 INFO L242 hiAutomatonCegarLoop]: Abstraction has 42 states and 115 transitions. [2022-07-26 13:52:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 13:52:52,792 INFO L426 stractBuchiCegarLoop]: Abstraction has 42 states and 115 transitions. [2022-07-26 13:52:52,792 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 13:52:52,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 115 transitions. [2022-07-26 13:52:52,792 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-07-26 13:52:52,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:52:52,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:52:52,793 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:52:52,793 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:52:52,793 INFO L733 eck$LassoCheckResult]: Stem: 1028#[ULTIMATE.startENTRY]don't care [533] ULTIMATE.startENTRY-->L91-6: Formula: (let ((.cse2 (store |v_#valid_190| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1)) (.cse1 (select |v_#memory_int_117| 1))) (and (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 1) |v_#valid_189|) (= 48 (select .cse1 0)) (= v_~A~0.offset_67 0) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_190| 2) 1) (= (store (store (store |v_#length_151| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_150|) (= |v_#NULL.base_12| 0) (= v_~A~0.base_67 0) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= (select |v_#valid_190| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) 0) (= (select |v_#valid_190| 0) 0) (= v_~counter~0_135 0) (< 0 |v_#StackHeapBarrier_37|) (= 32 (select |v_#length_151| 2)) (= 2 (select |v_#length_151| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_64) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43| 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= (select .cse1 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (= |v_#NULL.offset_12| 0) (= (select |v_#valid_190| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| |v_#StackHeapBarrier_37|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_37|, #valid=|v_#valid_190|, #memory_int=|v_#memory_int_117|, #length=|v_#length_151|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~A~0.base=v_~A~0.base_67, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_33|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_25|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_30|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_36|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, #length=|v_#length_150|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_48|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_31|, ~counter~0=v_~counter~0_135, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_64, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_33|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #StackHeapBarrier=|v_#StackHeapBarrier_37|, ~A~0.offset=v_~A~0.offset_67, #valid=|v_#valid_189|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_26|, #memory_int=|v_#memory_int_117|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1030#[L91-6]don't care [516] L91-6-->L91-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|) (= (store |v_#memory_int_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_21|)) |v_#memory_int_101|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 1)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_102|, #length=|v_#length_122|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_15|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_101|, #length=|v_#length_122|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 1034#[L91-6]don't care [523] L91-6-->L75-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~A~0.base_63) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_132| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_main_#t~pre9#1_27| |v_#pthreadsForks_36|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre9#1_27|))) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~A~0.offset_63) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_161| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, #valid=|v_#valid_161|, #memory_int=|v_#memory_int_112|, #length=|v_#length_132|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{~A~0.base=v_~A~0.base_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_25|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, ~A~0.offset=v_~A~0.offset_63, #pthreadsForks=|v_#pthreadsForks_35|, #valid=|v_#valid_161|, #memory_int=|v_#memory_int_111|, #length=|v_#length_132|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_25|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_38|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 1008#[L75-3]don't care [421] L75-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 1010#[L75-4, thread1ENTRY]don't care [508] L75-4-->L76-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (select |v_#valid_127| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre11#1_21|)) |v_#memory_int_85|) (= |v_ULTIMATE.start_main_#t~pre11#1_21| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_104| |v_ULTIMATE.start_main_~#t2~0#1.base_31|))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_86|, #length=|v_#length_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_17|, #valid=|v_#valid_127|, #memory_int=|v_#memory_int_85|, #length=|v_#length_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int] 988#[L76-3, thread1ENTRY]don't care [418] L76-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_4|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_14|, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_4|, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_4|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_8|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~ret6#1] 990#[thread1ENTRY, thread2ENTRY, L76-4]don't care [406] thread2ENTRY-->L59-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] 1024#[thread1ENTRY, L59-4, L76-4]don't care [2022-07-26 13:52:52,793 INFO L735 eck$LassoCheckResult]: Loop: 1024#[thread1ENTRY, L59-4, L76-4]don't care [507] L59-4-->L59-4: Formula: (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_38| 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_51))) (and (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_15| |v_thread2Thread1of1ForFork0_minus_~a#1_15|) (not (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~b#1_15| 0) (<= |v_thread2Thread1of1ForFork0_minus_~b#1_15| (+ 2147483648 |v_thread2Thread1of1ForFork0_minus_~a#1_15|))) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_minus_#in~a#1_15| v_~counter~0_110) (< |v_thread2Thread1of1ForFork0_~i~1#1_38| v_~N~0_44) (= (ite (or (<= |v_thread2Thread1of1ForFork0_minus_~a#1_15| (+ 2147483647 |v_thread2Thread1of1ForFork0_minus_~b#1_15|)) (<= 0 |v_thread2Thread1of1ForFork0_minus_~b#1_15|)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_15|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_15| |v_thread2Thread1of1ForFork0_minus_~b#1_15|) (= (+ |v_thread2Thread1of1ForFork0_minus_~a#1_15| (* (- 1) |v_thread2Thread1of1ForFork0_minus_~b#1_15|)) |v_thread2Thread1of1ForFork0_minus_#res#1_15|) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_38| 1) |v_thread2Thread1of1ForFork0_~i~1#1_37|) (<= (+ .cse0 v_~A~0.offset_51 4) (select |v_#length_102| v_~A~0.base_51)) (<= 0 .cse1) (= |v_thread2Thread1of1ForFork0_minus_#in~b#1_15| (select (select |v_#memory_int_83| v_~A~0.base_51) .cse1)) (= v_~counter~0_109 |v_thread2Thread1of1ForFork0_minus_#res#1_15|) (= (select |v_#valid_125| v_~A~0.base_51) 1)))) InVars {~counter~0=v_~counter~0_110, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_83|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_38|, #length=|v_#length_102|, ~N~0=v_~N~0_44} OutVars{~counter~0=v_~counter~0_109, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork0_minus_~b#1=|v_thread2Thread1of1ForFork0_minus_~b#1_15|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork0_minus_#res#1=|v_thread2Thread1of1ForFork0_minus_#res#1_15|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_37|, ~N~0=v_~N~0_44, thread2Thread1of1ForFork0_minus_~a#1=|v_thread2Thread1of1ForFork0_minus_~a#1_15|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_15|, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork0_minus_#in~a#1=|v_thread2Thread1of1ForFork0_minus_#in~a#1_15|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_83|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_15|, thread2Thread1of1ForFork0_minus_#in~b#1=|v_thread2Thread1of1ForFork0_minus_#in~b#1_15|, #length=|v_#length_102|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_15|, thread2Thread1of1ForFork0_#t~ret6#1=|v_thread2Thread1of1ForFork0_#t~ret6#1_15|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_minus_#res#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~ret6#1] 1024#[thread1ENTRY, L59-4, L76-4]don't care [2022-07-26 13:52:52,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash 424687526, now seen corresponding path program 1 times [2022-07-26 13:52:52,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:52,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348383220] [2022-07-26 13:52:52,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:52,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:52,805 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:52,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:52,820 INFO L85 PathProgramCache]: Analyzing trace with hash 538, now seen corresponding path program 2 times [2022-07-26 13:52:52,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:52,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211095931] [2022-07-26 13:52:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:52,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:52,823 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:52,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:52,827 INFO L85 PathProgramCache]: Analyzing trace with hash 280411925, now seen corresponding path program 1 times [2022-07-26 13:52:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:52:52,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134093212] [2022-07-26 13:52:52,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:52:52,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:52:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:52,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:52:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:52:52,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:52:52,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:53,752 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:52:53,752 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:52:53,752 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:52:53,752 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:52:53,752 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:52:53,752 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:53,752 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:52:53,752 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:52:53,752 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue2.wvr.c_BEv2_Iteration5_Lasso [2022-07-26 13:52:53,752 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:52:53,752 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:52:53,755 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:53,757 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:53,758 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:53,760 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:53,761 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,311 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,313 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,317 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,318 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,319 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,320 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,322 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,323 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,325 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,326 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,327 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,329 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,331 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,334 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,336 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,337 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,338 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,340 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,341 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,343 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,344 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,346 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,347 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,349 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,351 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,352 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,354 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,355 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,356 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,360 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,361 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,362 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,366 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,369 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,376 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,377 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,379 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,380 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:52:54,958 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:52:54,958 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:52:54,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:54,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:54,959 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:54,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-26 13:52:54,961 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 [2022-07-26 13:52:54,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:54,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:54,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:54,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:54,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:54,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:54,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:54,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:54,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-26 13:52:54,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:54,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:54,983 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:54,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-26 13:52:54,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:52:54,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:54,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:54,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:54,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:54,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:54,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:54,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:54,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:55,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-26 13:52:55,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:55,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:55,008 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:55,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-26 13:52:55,010 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 [2022-07-26 13:52:55,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:55,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:52:55,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:55,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:55,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:55,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:52:55,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:52:55,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:55,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-26 13:52:55,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:55,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:55,032 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:55,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-26 13:52:55,034 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 [2022-07-26 13:52:55,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:55,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:55,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:55,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:55,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:55,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:55,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:55,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-26 13:52:55,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:55,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:55,071 INFO L229 MonitoredProcess]: Starting monitored process 65 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) [2022-07-26 13:52:55,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-26 13:52:55,073 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 [2022-07-26 13:52:55,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:55,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:55,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:55,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:55,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:55,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:55,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:55,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:55,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:55,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:55,104 INFO L229 MonitoredProcess]: Starting monitored process 66 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) [2022-07-26 13:52:55,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-26 13:52:55,108 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 [2022-07-26 13:52:55,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:55,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:55,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:55,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:55,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:55,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:55,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:55,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:55,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:55,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:55,156 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:55,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-26 13:52:55,160 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 [2022-07-26 13:52:55,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:55,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:55,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:55,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:55,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:55,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:55,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:55,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:55,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:55,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:55,204 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:55,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-26 13:52:55,206 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 [2022-07-26 13:52:55,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:55,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:55,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:55,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:55,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:55,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:55,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:55,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-26 13:52:55,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:55,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:55,232 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:55,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-26 13:52:55,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:52:55,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:55,239 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 13:52:55,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:55,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:55,242 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 13:52:55,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:55,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:55,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:55,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:55,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:55,269 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:55,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-26 13:52:55,271 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 [2022-07-26 13:52:55,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:55,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:55,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:55,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:55,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:55,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:55,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:52:55,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-26 13:52:55,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:55,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:55,315 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:55,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-26 13:52:55,317 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 [2022-07-26 13:52:55,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:52:55,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:52:55,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:52:55,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:52:55,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:52:55,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:52:55,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:52:55,378 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2022-07-26 13:52:55,379 INFO L444 ModelExtractionUtils]: 5 out of 40 variables were initially zero. Simplification set additionally 31 variables to zero. [2022-07-26 13:52:55,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:52:55,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:52:55,380 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:52:55,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-26 13:52:55,383 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:52:55,388 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 13:52:55,389 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:52:55,389 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_3, thread2Thread1of1ForFork0_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_3 - 4*thread2Thread1of1ForFork0_~i~1#1 Supporting invariants [1*~A~0.offset >= 0] [2022-07-26 13:52:55,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-07-26 13:52:55,469 INFO L156 tatePredicateManager]: 28 out of 30 supporting invariants were superfluous and have been removed [2022-07-26 13:52:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:52:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:52:55,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-26 13:52:55,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:52:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:52:55,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-26 13:52:55,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:52:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:52:55,567 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2022-07-26 13:52:55,567 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 115 transitions. cyclomatic complexity: 88 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:52:55,621 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 115 transitions. cyclomatic complexity: 88. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 85 states and 223 transitions. Complement of second has 6 states. [2022-07-26 13:52:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 13:52:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:52:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-07-26 13:52:55,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-26 13:52:55,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:52:55,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-26 13:52:55,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:52:55,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-26 13:52:55,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:52:55,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 223 transitions. [2022-07-26 13:52:55,627 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:52:55,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2022-07-26 13:52:55,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 13:52:55,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 13:52:55,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 13:52:55,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:52:55,627 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:52:55,627 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:52:55,627 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:52:55,627 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 13:52:55,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 13:52:55,628 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:52:55,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 13:52:55,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:52:55 BoogieIcfgContainer [2022-07-26 13:52:55,633 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:52:55,633 INFO L158 Benchmark]: Toolchain (without parser) took 13523.98ms. Allocated memory was 191.9MB in the beginning and 311.4MB in the end (delta: 119.5MB). Free memory was 141.5MB in the beginning and 210.2MB in the end (delta: -68.7MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2022-07-26 13:52:55,633 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 191.9MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:52:55,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.16ms. Allocated memory is still 191.9MB. Free memory was 141.3MB in the beginning and 166.1MB in the end (delta: -24.8MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-07-26 13:52:55,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.50ms. Allocated memory is still 191.9MB. Free memory was 166.1MB in the beginning and 164.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:52:55,634 INFO L158 Benchmark]: Boogie Preprocessor took 32.45ms. Allocated memory is still 191.9MB. Free memory was 164.0MB in the beginning and 163.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 13:52:55,634 INFO L158 Benchmark]: RCFGBuilder took 425.74ms. Allocated memory is still 191.9MB. Free memory was 163.0MB in the beginning and 140.4MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-07-26 13:52:55,635 INFO L158 Benchmark]: BuchiAutomizer took 12738.55ms. Allocated memory was 191.9MB in the beginning and 311.4MB in the end (delta: 119.5MB). Free memory was 139.9MB in the beginning and 210.2MB in the end (delta: -70.3MB). Peak memory consumption was 50.8MB. Max. memory is 8.0GB. [2022-07-26 13:52:55,636 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.13ms. Allocated memory is still 191.9MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.16ms. Allocated memory is still 191.9MB. Free memory was 141.3MB in the beginning and 166.1MB in the end (delta: -24.8MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.50ms. Allocated memory is still 191.9MB. Free memory was 166.1MB in the beginning and 164.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.45ms. Allocated memory is still 191.9MB. Free memory was 164.0MB in the beginning and 163.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 425.74ms. Allocated memory is still 191.9MB. Free memory was 163.0MB in the beginning and 140.4MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 12738.55ms. Allocated memory was 191.9MB in the beginning and 311.4MB in the end (delta: 119.5MB). Free memory was 139.9MB in the beginning and 210.2MB in the end (delta: -70.3MB). Peak memory consumption was 50.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function size + -1 * i and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[arr] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[arr] + i * -4 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 8.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 182 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 14 mSDtfsCounter, 182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital275 mio100 ax109 hnf100 lsp82 ukn81 mio100 lsp37 div122 bol100 ite100 ukn100 eq174 hnf91 smp84 dnf145 smp73 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 3.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 110 PlacesBefore, 21 PlacesAfterwards, 112 TransitionsBefore, 17 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 7 FixpointIterations, 73 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 110 TotalNumberOfCompositions, 565 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 528, positive: 517, positive conditional: 0, positive unconditional: 517, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 339, positive: 332, positive conditional: 0, positive unconditional: 332, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 339, positive: 332, positive conditional: 0, positive unconditional: 332, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 528, positive: 185, positive conditional: 0, positive unconditional: 185, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 339, unknown conditional: 0, unknown unconditional: 339] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 RESULT: Ultimate proved your program to be correct! [2022-07-26 13:52:55,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-26 13:52:55,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...