/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-commit-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:21:27,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:21:27,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:21:27,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:21:27,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:21:27,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:21:27,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:21:27,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:21:27,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:21:27,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:21:27,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:21:27,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:21:27,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:21:27,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:21:27,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:21:27,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:21:27,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:21:27,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:21:27,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:21:27,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:21:27,417 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:21:27,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:21:27,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:21:27,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:21:27,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:21:27,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:21:27,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:21:27,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:21:27,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:21:27,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:21:27,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:21:27,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:21:27,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:21:27,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:21:27,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:21:27,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:21:27,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:21:27,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:21:27,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:21:27,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:21:27,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:21:27,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:21:27,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:21:27,479 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:21:27,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:21:27,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:21:27,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:21:27,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:21:27,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:21:27,483 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:21:27,483 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:21:27,483 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:21:27,483 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:21:27,484 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:21:27,484 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:21:27,484 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:21:27,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:21:27,484 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:21:27,485 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:21:27,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:21:27,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:21:27,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:21:27,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:21:27,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:21:27,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:21:27,486 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:21:27,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:21:27,487 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:21:27,487 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:21:27,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:21:27,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:21:27,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:21:27,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:21:27,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:21:27,489 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:21:27,489 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-22 12:21:27,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:21:27,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:21:27,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:21:27,973 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:21:27,974 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:21:27,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2022-07-22 12:21:28,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34043440/2c5163e54d0440cb8e728fcaf6ba47b5/FLAG87be0bf70 [2022-07-22 12:21:28,694 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:21:28,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2022-07-22 12:21:28,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34043440/2c5163e54d0440cb8e728fcaf6ba47b5/FLAG87be0bf70 [2022-07-22 12:21:29,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e34043440/2c5163e54d0440cb8e728fcaf6ba47b5 [2022-07-22 12:21:29,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:21:29,044 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:21:29,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:21:29,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:21:29,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:21:29,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24948e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29, skipping insertion in model container [2022-07-22 12:21:29,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:21:29,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:21:29,314 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-commit-1.wvr.c[4604,4617] [2022-07-22 12:21:29,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:21:29,334 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:21:29,370 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-commit-1.wvr.c[4604,4617] [2022-07-22 12:21:29,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:21:29,396 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:21:29,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29 WrapperNode [2022-07-22 12:21:29,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:21:29,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:21:29,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:21:29,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:21:29,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,468 INFO L137 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 322 [2022-07-22 12:21:29,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:21:29,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:21:29,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:21:29,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:21:29,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:21:29,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:21:29,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:21:29,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:21:29,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29" (1/1) ... [2022-07-22 12:21:29,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:29,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:29,581 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-22 12:21:29,601 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-22 12:21:29,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:21:29,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:21:29,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:21:29,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:21:29,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:21:29,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:21:29,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:21:29,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:21:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:21:29,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:21:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:21:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:21:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:21:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:21:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:21:29,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:21:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:21:29,670 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:21:29,841 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:21:29,843 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:21:30,609 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:21:30,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:21:30,939 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-22 12:21:30,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:21:30 BoogieIcfgContainer [2022-07-22 12:21:30,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:21:30,944 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:21:30,945 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:21:30,949 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:21:30,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:21:30,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:21:29" (1/3) ... [2022-07-22 12:21:30,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64bdd5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:21:30, skipping insertion in model container [2022-07-22 12:21:30,952 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:21:30,953 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:21:29" (2/3) ... [2022-07-22 12:21:30,953 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64bdd5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:21:30, skipping insertion in model container [2022-07-22 12:21:30,953 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:21:30,953 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:21:30" (3/3) ... [2022-07-22 12:21:30,955 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2022-07-22 12:21:31,068 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:21:31,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 233 places, 245 transitions, 514 flow [2022-07-22 12:21:31,211 INFO L129 PetriNetUnfolder]: 19/239 cut-off events. [2022-07-22 12:21:31,211 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:21:31,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 239 events. 19/239 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 123 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 203. Up to 2 conditions per place. [2022-07-22 12:21:31,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 245 transitions, 514 flow [2022-07-22 12:21:31,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 239 transitions, 496 flow [2022-07-22 12:21:31,235 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:21:31,252 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 239 transitions, 496 flow [2022-07-22 12:21:31,256 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 239 transitions, 496 flow [2022-07-22 12:21:31,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 230 places, 239 transitions, 496 flow [2022-07-22 12:21:31,321 INFO L129 PetriNetUnfolder]: 19/239 cut-off events. [2022-07-22 12:21:31,322 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:21:31,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 239 events. 19/239 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 129 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 203. Up to 2 conditions per place. [2022-07-22 12:21:31,328 INFO L116 LiptonReduction]: Number of co-enabled transitions 1266 [2022-07-22 12:21:40,222 INFO L131 LiptonReduction]: Checked pairs total: 2576 [2022-07-22 12:21:40,223 INFO L133 LiptonReduction]: Total number of compositions: 248 [2022-07-22 12:21:40,250 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:21:40,250 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:21:40,250 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:21:40,250 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:21:40,250 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:21:40,251 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:21:40,251 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:21:40,251 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:21:40,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:21:40,352 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 147 [2022-07-22 12:21:40,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:40,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:40,359 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:21:40,359 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:21:40,359 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:21:40,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 160 states, but on-demand construction may add more states [2022-07-22 12:21:40,373 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 147 [2022-07-22 12:21:40,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:40,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:40,374 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:21:40,374 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:21:40,380 INFO L748 eck$LassoCheckResult]: Stem: 236#[ULTIMATE.startENTRY]don't care [1218] ULTIMATE.startENTRY-->L158-6: Formula: (let ((.cse1 (store |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (let ((.cse2 (select |v_#memory_int_326| 1)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75| 1))) (and (= v_~node~0.base_71 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) (= v_~client~0.base_51 0) (= v_~manager_back~0_201 v_~manager_front~0_188) (= v_~manager_size~0_128 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|) (= |v_#NULL.base_12| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75|) 0) (= v_~ok~0_99 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57| |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) (= (select |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) 1 0))) (= (select |v_#valid_423| 2) 1) (= v_~node~0.offset_71 0) (= v_~manager~0.offset_127 0) (= v_~node_back~0_114 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|) (= (store (store (store (store |v_#length_376| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_75| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4)) |v_#length_374|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_65| 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (= v_~manager~0.base_127 0) (= (select .cse2 1) 0) (= v_~node_size~0_74 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|) (= v_~client_size~0_74 0) (= v_~client~0.offset_51 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4294967296) 1073741823) 1 0)) (< 0 |v_#StackHeapBarrier_76|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_75| 0) (= |v_#valid_421| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= (select |v_#valid_423| 0) 0) (= (select .cse2 0) 48) (= (select |v_#length_376| 1) 2) (= 0 v_~node_front~0_96) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|) (= v_~safe~0_204 1) (= v_~client_front~0_72 0) (= v_~update~0_123 0) (= (select |v_#valid_423| 1) 1) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= v_~client_back~0_92 0) (= 22 (select |v_#length_376| 2)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_76|, #valid=|v_#valid_423|, #memory_int=|v_#memory_int_326|, #length=|v_#length_376|} OutVars{~node_back~0=v_~node_back~0_114, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_51|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_28|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_37|, ~manager_front~0=v_~manager_front~0_188, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~node_size~0=v_~node_size~0_74, ~client_front~0=v_~client_front~0_72, #length=|v_#length_374|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_41|, ~client~0.base=v_~client~0.base_51, ~update~0=v_~update~0_123, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~ok~0=v_~ok~0_99, ~node~0.base=v_~node~0.base_71, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_198|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_34|, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_22|, ~safe~0=v_~safe~0_204, ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_22|, ~client_size~0=v_~client_size~0_74, ~node_front~0=v_~node_front~0_96, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_37|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_44|, ~client_back~0=v_~client_back~0_92, ~client~0.offset=v_~client~0.offset_51, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_33|, ~manager~0.offset=v_~manager~0.offset_127, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_84|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_65|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_41|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_32|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_30|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~manager_back~0=v_~manager_back~0_201, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_94|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~node~0.offset=v_~node~0.offset_71, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_33|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_69|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_119|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ~manager~0.base=v_~manager~0.base_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_19|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_85|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_326|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_119|, ~manager_size~0=v_~manager_size~0_128, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~ret29#1.offset, ~manager_front~0, ULTIMATE.start_main_#t~nondet30#1, ~node_size~0, ~client_front~0, #length, ULTIMATE.start_main_#t~ret26#1.offset, ~client~0.base, ~update~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ~node~0.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~mem42#1, ~safe~0, ULTIMATE.start_main_#t~mem41#1, ~client_size~0, ~node_front~0, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~nondet28#1, ~client_back~0, ~client~0.offset, ULTIMATE.start_main_#t~ret32#1.base, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ~manager_back~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ~manager~0.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, ~manager_size~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 239#[L158-6]don't care [2022-07-22 12:21:40,381 INFO L750 eck$LassoCheckResult]: Loop: 239#[L158-6]don't care [1144] L158-6-->L158-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67| 4) (select |v_#length_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|)) (= (select |v_#valid_285| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_106|) (<= 0 .cse1) (= (store |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67| (store (select |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|)) |v_#memory_int_246|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_247|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_246|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int] 239#[L158-6]don't care [2022-07-22 12:21:40,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1249, now seen corresponding path program 1 times [2022-07-22 12:21:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:40,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077831625] [2022-07-22 12:21:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:40,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:40,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:40,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:40,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:40,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1175, now seen corresponding path program 1 times [2022-07-22 12:21:40,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:40,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600271785] [2022-07-22 12:21:40,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:40,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:40,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:40,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash 39863, now seen corresponding path program 1 times [2022-07-22 12:21:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:40,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584378256] [2022-07-22 12:21:40,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:40,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:40,791 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:40,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:41,960 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:21:41,961 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:21:41,961 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:21:41,961 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:21:41,962 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:21:41,962 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:41,962 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:21:41,962 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:21:41,962 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-commit-1.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:21:41,963 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:21:41,963 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:21:41,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:41,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:42,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:43,145 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:21:43,151 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:21:43,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,158 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-22 12:21:43,168 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-22 12:21:43,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:21:43,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:43,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:43,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:43,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,236 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-22 12:21:43,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,238 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-22 12:21:43,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:21:43,241 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-22 12:21:43,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:43,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:43,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:43,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,285 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-22 12:21:43,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,287 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-22 12:21:43,293 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-22 12:21:43,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:43,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:43,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,356 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-22 12:21:43,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,359 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-22 12:21:43,371 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-22 12:21:43,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:43,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:43,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,435 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-22 12:21:43,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,439 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-22 12:21:43,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:43,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:43,463 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-22 12:21:43,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,501 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-22 12:21:43,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,502 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-22 12:21:43,504 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-22 12:21:43,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:43,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:43,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,547 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-22 12:21:43,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,549 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-22 12:21:43,550 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-22 12:21:43,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:43,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:43,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,622 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-22 12:21:43,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,623 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-22 12:21:43,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,626 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-22 12:21:43,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:43,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:43,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:43,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,686 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-22 12:21:43,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,688 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-22 12:21:43,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,696 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-22 12:21:43,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:43,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:43,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,740 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-22 12:21:43,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,742 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-22 12:21:43,746 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-22 12:21:43,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:43,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:43,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:43,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,783 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-22 12:21:43,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,785 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-22 12:21:43,786 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-22 12:21:43,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-22 12:21:43,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:43,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:43,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:43,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,821 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-22 12:21:43,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,822 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-22 12:21:43,826 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-22 12:21:43,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:43,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:43,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,896 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-22 12:21:43,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,897 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-22 12:21:43,900 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-22 12:21:43,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:43,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:43,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,942 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-22 12:21:43,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,944 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-22 12:21:43,945 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-22 12:21:43,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:43,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:43,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:43,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:43,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:43,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:43,983 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-22 12:21:43,984 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-22 12:21:43,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:43,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:43,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:43,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:43,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:43,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:43,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:44,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:44,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 12:21:44,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:44,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:44,053 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-22 12:21:44,058 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-22 12:21:44,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:44,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:44,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:44,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:44,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:44,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:44,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:44,115 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:21:44,158 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-22 12:21:44,158 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-22 12:21:44,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:44,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:44,168 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-22 12:21:44,203 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:21:44,205 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-22 12:21:44,226 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:21:44,226 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:21:44,227 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:21:44,298 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-22 12:21:44,405 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:21:44,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:44,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:21:44,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:21:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:44,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:21:44,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:21:44,483 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-22 12:21:44,520 INFO L142 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-22 12:21:44,523 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 160 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-22 12:21:44,580 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 160 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 163 states and 505 transitions. Complement of second has 3 states. [2022-07-22 12:21:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:21:44,593 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-22 12:21:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:21:44,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:21:44,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:44,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:21:44,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:44,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:21:44,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:44,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 505 transitions. [2022-07-22 12:21:44,604 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 146 [2022-07-22 12:21:44,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 155 states and 486 transitions. [2022-07-22 12:21:44,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2022-07-22 12:21:44,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2022-07-22 12:21:44,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 486 transitions. [2022-07-22 12:21:44,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:21:44,622 INFO L220 hiAutomatonCegarLoop]: Abstraction has 155 states and 486 transitions. [2022-07-22 12:21:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 486 transitions. [2022-07-22 12:21:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2022-07-22 12:21:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 154 states have (on average 3.142857142857143) internal successors, (484), 153 states have internal predecessors, (484), 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-22 12:21:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 484 transitions. [2022-07-22 12:21:44,674 INFO L242 hiAutomatonCegarLoop]: Abstraction has 154 states and 484 transitions. [2022-07-22 12:21:44,674 INFO L425 stractBuchiCegarLoop]: Abstraction has 154 states and 484 transitions. [2022-07-22 12:21:44,674 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:21:44,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 484 transitions. [2022-07-22 12:21:44,677 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 146 [2022-07-22 12:21:44,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:44,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:44,678 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:21:44,678 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:21:44,679 INFO L748 eck$LassoCheckResult]: Stem: 1128#[ULTIMATE.startENTRY]don't care [1218] ULTIMATE.startENTRY-->L158-6: Formula: (let ((.cse1 (store |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (let ((.cse2 (select |v_#memory_int_326| 1)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75| 1))) (and (= v_~node~0.base_71 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) (= v_~client~0.base_51 0) (= v_~manager_back~0_201 v_~manager_front~0_188) (= v_~manager_size~0_128 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|) (= |v_#NULL.base_12| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75|) 0) (= v_~ok~0_99 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57| |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) (= (select |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) 1 0))) (= (select |v_#valid_423| 2) 1) (= v_~node~0.offset_71 0) (= v_~manager~0.offset_127 0) (= v_~node_back~0_114 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|) (= (store (store (store (store |v_#length_376| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_75| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4)) |v_#length_374|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_65| 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (= v_~manager~0.base_127 0) (= (select .cse2 1) 0) (= v_~node_size~0_74 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|) (= v_~client_size~0_74 0) (= v_~client~0.offset_51 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4294967296) 1073741823) 1 0)) (< 0 |v_#StackHeapBarrier_76|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_75| 0) (= |v_#valid_421| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= (select |v_#valid_423| 0) 0) (= (select .cse2 0) 48) (= (select |v_#length_376| 1) 2) (= 0 v_~node_front~0_96) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|) (= v_~safe~0_204 1) (= v_~client_front~0_72 0) (= v_~update~0_123 0) (= (select |v_#valid_423| 1) 1) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= v_~client_back~0_92 0) (= 22 (select |v_#length_376| 2)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_76|, #valid=|v_#valid_423|, #memory_int=|v_#memory_int_326|, #length=|v_#length_376|} OutVars{~node_back~0=v_~node_back~0_114, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_51|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_28|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_37|, ~manager_front~0=v_~manager_front~0_188, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~node_size~0=v_~node_size~0_74, ~client_front~0=v_~client_front~0_72, #length=|v_#length_374|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_41|, ~client~0.base=v_~client~0.base_51, ~update~0=v_~update~0_123, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~ok~0=v_~ok~0_99, ~node~0.base=v_~node~0.base_71, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_198|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_34|, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_22|, ~safe~0=v_~safe~0_204, ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_22|, ~client_size~0=v_~client_size~0_74, ~node_front~0=v_~node_front~0_96, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_37|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_44|, ~client_back~0=v_~client_back~0_92, ~client~0.offset=v_~client~0.offset_51, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_33|, ~manager~0.offset=v_~manager~0.offset_127, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_84|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_65|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_41|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_32|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_30|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~manager_back~0=v_~manager_back~0_201, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_94|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~node~0.offset=v_~node~0.offset_71, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_33|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_69|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_119|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ~manager~0.base=v_~manager~0.base_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_19|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_85|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_326|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_119|, ~manager_size~0=v_~manager_size~0_128, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~ret29#1.offset, ~manager_front~0, ULTIMATE.start_main_#t~nondet30#1, ~node_size~0, ~client_front~0, #length, ULTIMATE.start_main_#t~ret26#1.offset, ~client~0.base, ~update~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ~node~0.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~mem42#1, ~safe~0, ULTIMATE.start_main_#t~mem41#1, ~client_size~0, ~node_front~0, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~nondet28#1, ~client_back~0, ~client~0.offset, ULTIMATE.start_main_#t~ret32#1.base, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ~manager_back~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ~manager~0.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, ~manager_size~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1114#[L158-6]don't care [1217] L158-6-->L158-14: Formula: (and (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_In_1| v_~client_size~0_Out_2) (= 0 (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~manager~0.offset_Out_2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_7|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (= |v_ULTIMATE.start_main_#t~nondet27#1_In_1| v_~client_front~0_Out_2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7| v_~manager~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~client_back~0_Out_2 v_~client_front~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= v_~client_size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_In_1|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_In_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~client_back~0=v_~client_back~0_Out_2, ~manager~0.offset=v_~manager~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ~client_front~0=v_~client_front~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ~manager~0.base=v_~manager~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_Out_6|, #valid=|v_#valid_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_Out_18|, ~client_size~0=v_~client_size~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client_back~0, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~manager~0.base, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~client_front~0, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~client_size~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] 1068#[L158-14]don't care [2022-07-22 12:21:44,679 INFO L750 eck$LassoCheckResult]: Loop: 1068#[L158-14]don't care [1139] L158-14-->L158-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| .cse1))) (and (= (select |v_#valid_277| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|) 1) (= (store |v_#memory_int_243| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61| (store (select |v_#memory_int_243| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_41|)) |v_#memory_int_242|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| 4 .cse1) (select |v_#length_244| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|)) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|) (<= 0 .cse0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| |v_ULTIMATE.start_create_fresh_int_array_~size#1_102|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73|, #valid=|v_#valid_277|, #memory_int=|v_#memory_int_243|, #length=|v_#length_244|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_102|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_43|, #valid=|v_#valid_277|, #memory_int=|v_#memory_int_242|, #length=|v_#length_244|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_102|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #memory_int] 1068#[L158-14]don't care [2022-07-22 12:21:44,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash 39936, now seen corresponding path program 1 times [2022-07-22 12:21:44,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:44,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452665725] [2022-07-22 12:21:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:44,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:44,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:44,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:44,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1170, now seen corresponding path program 1 times [2022-07-22 12:21:44,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:44,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519060548] [2022-07-22 12:21:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:44,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:44,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:44,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:44,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1239155, now seen corresponding path program 1 times [2022-07-22 12:21:44,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:44,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466653638] [2022-07-22 12:21:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:44,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:44,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:46,971 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-22 12:21:47,392 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:21:47,392 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:21:47,392 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:21:47,392 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:21:47,393 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:21:47,393 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:47,393 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:21:47,393 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:21:47,393 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-commit-1.wvr.c_BEv2_Iteration2_Lasso [2022-07-22 12:21:47,393 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:21:47,393 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:21:47,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:47,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:48,720 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:21:48,720 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:21:48,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:48,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:48,726 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-22 12:21:48,733 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-22 12:21:48,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:48,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:48,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:48,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:48,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:48,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:48,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:48,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:48,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:48,767 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-22 12:21:48,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:48,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:48,768 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-22 12:21:48,774 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-22 12:21:48,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:48,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:48,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:48,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:48,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:48,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:48,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:48,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:48,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:48,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-22 12:21:48,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:48,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:48,807 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-22 12:21:48,810 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-22 12:21:48,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:48,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:48,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:48,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:48,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:48,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:48,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:48,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:48,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:48,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-07-22 12:21:48,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:48,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:48,846 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-22 12:21:48,852 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-22 12:21:48,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:48,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:48,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:48,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:48,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:48,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:48,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:48,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:48,903 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-22 12:21:48,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:48,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:48,904 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-22 12:21:48,905 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-22 12:21:48,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:48,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:48,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:48,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:48,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:48,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:48,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:48,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:48,939 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-22 12:21:48,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:48,940 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-22 12:21:48,941 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-22 12:21:48,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:21:48,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:48,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:48,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:48,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:48,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:48,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:48,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:48,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:48,973 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-22 12:21:48,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:48,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:48,974 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-22 12:21:48,975 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-22 12:21:48,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:48,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:48,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:48,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:48,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:48,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:48,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:48,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:48,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:49,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:49,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:49,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:49,007 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-22 12:21:49,007 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-22 12:21:49,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-22 12:21:49,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:49,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:49,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:49,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:49,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:49,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:49,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:49,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:49,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 12:21:49,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:49,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:49,055 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-22 12:21:49,056 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-22 12:21:49,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:49,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:49,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:49,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:49,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:49,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:49,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:49,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:49,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:49,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:49,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:49,129 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-22 12:21:49,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:49,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:49,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:49,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:49,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:49,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:49,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:49,185 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-22 12:21:49,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:49,217 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-22 12:21:49,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:49,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:49,218 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-22 12:21:49,219 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-22 12:21:49,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-22 12:21:49,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:49,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:49,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:49,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:49,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:49,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:49,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:49,260 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-22 12:21:49,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:49,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:49,262 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-22 12:21:49,263 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-22 12:21:49,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:49,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:49,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:49,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:49,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:49,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:49,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:49,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:49,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:49,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:49,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:49,311 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-22 12:21:49,312 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-22 12:21:49,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:49,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:49,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:49,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:49,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:49,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:49,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:49,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:49,349 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-22 12:21:49,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:49,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:49,353 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-22 12:21:49,355 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-22 12:21:49,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:49,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:49,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:49,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:49,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:49,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:49,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:49,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:49,392 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-22 12:21:49,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:49,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:49,393 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-22 12:21:49,395 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-22 12:21:49,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:49,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:49,403 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-22 12:21:49,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:49,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:49,410 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-22 12:21:49,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:49,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:49,444 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-22 12:21:49,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:49,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:49,445 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-22 12:21:49,447 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-22 12:21:49,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:49,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:49,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:49,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:49,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:49,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:49,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:49,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:49,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:49,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:49,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:49,484 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-22 12:21:49,485 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-22 12:21:49,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:49,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:49,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:49,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:49,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:49,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:49,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:49,511 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:21:49,526 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 12:21:49,526 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 12:21:49,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:49,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:49,527 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-22 12:21:49,529 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-22 12:21:49,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:21:49,537 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:21:49,538 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:21:49,538 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:21:49,561 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-22 12:21:49,676 INFO L257 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2022-07-22 12:21:49,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:49,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:21:49,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:21:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:49,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:21:49,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:21:49,734 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-22 12:21:49,735 INFO L142 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-22 12:21:49,735 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 484 transitions. cyclomatic complexity: 363 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-22 12:21:49,761 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 484 transitions. cyclomatic complexity: 363. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 156 states and 488 transitions. Complement of second has 3 states. [2022-07-22 12:21:49,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:21:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-22 12:21:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-07-22 12:21:49,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:21:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:49,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:21:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:49,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 12:21:49,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:49,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 488 transitions. [2022-07-22 12:21:49,768 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 145 [2022-07-22 12:21:49,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 488 transitions. [2022-07-22 12:21:49,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2022-07-22 12:21:49,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2022-07-22 12:21:49,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 488 transitions. [2022-07-22 12:21:49,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:21:49,776 INFO L220 hiAutomatonCegarLoop]: Abstraction has 156 states and 488 transitions. [2022-07-22 12:21:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 488 transitions. [2022-07-22 12:21:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2022-07-22 12:21:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 155 states have (on average 3.1354838709677417) internal successors, (486), 154 states have internal predecessors, (486), 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-22 12:21:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 486 transitions. [2022-07-22 12:21:49,790 INFO L242 hiAutomatonCegarLoop]: Abstraction has 155 states and 486 transitions. [2022-07-22 12:21:49,791 INFO L425 stractBuchiCegarLoop]: Abstraction has 155 states and 486 transitions. [2022-07-22 12:21:49,791 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:21:49,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 486 transitions. [2022-07-22 12:21:49,793 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 145 [2022-07-22 12:21:49,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:49,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:49,794 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:21:49,794 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:21:49,795 INFO L748 eck$LassoCheckResult]: Stem: 1727#[ULTIMATE.startENTRY]don't care [1218] ULTIMATE.startENTRY-->L158-6: Formula: (let ((.cse1 (store |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (let ((.cse2 (select |v_#memory_int_326| 1)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75| 1))) (and (= v_~node~0.base_71 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) (= v_~client~0.base_51 0) (= v_~manager_back~0_201 v_~manager_front~0_188) (= v_~manager_size~0_128 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|) (= |v_#NULL.base_12| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75|) 0) (= v_~ok~0_99 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57| |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) (= (select |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) 1 0))) (= (select |v_#valid_423| 2) 1) (= v_~node~0.offset_71 0) (= v_~manager~0.offset_127 0) (= v_~node_back~0_114 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|) (= (store (store (store (store |v_#length_376| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_75| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4)) |v_#length_374|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_65| 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (= v_~manager~0.base_127 0) (= (select .cse2 1) 0) (= v_~node_size~0_74 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|) (= v_~client_size~0_74 0) (= v_~client~0.offset_51 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4294967296) 1073741823) 1 0)) (< 0 |v_#StackHeapBarrier_76|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_75| 0) (= |v_#valid_421| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= (select |v_#valid_423| 0) 0) (= (select .cse2 0) 48) (= (select |v_#length_376| 1) 2) (= 0 v_~node_front~0_96) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|) (= v_~safe~0_204 1) (= v_~client_front~0_72 0) (= v_~update~0_123 0) (= (select |v_#valid_423| 1) 1) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= v_~client_back~0_92 0) (= 22 (select |v_#length_376| 2)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_76|, #valid=|v_#valid_423|, #memory_int=|v_#memory_int_326|, #length=|v_#length_376|} OutVars{~node_back~0=v_~node_back~0_114, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_51|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_28|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_37|, ~manager_front~0=v_~manager_front~0_188, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~node_size~0=v_~node_size~0_74, ~client_front~0=v_~client_front~0_72, #length=|v_#length_374|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_41|, ~client~0.base=v_~client~0.base_51, ~update~0=v_~update~0_123, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~ok~0=v_~ok~0_99, ~node~0.base=v_~node~0.base_71, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_198|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_34|, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_22|, ~safe~0=v_~safe~0_204, ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_22|, ~client_size~0=v_~client_size~0_74, ~node_front~0=v_~node_front~0_96, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_37|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_44|, ~client_back~0=v_~client_back~0_92, ~client~0.offset=v_~client~0.offset_51, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_33|, ~manager~0.offset=v_~manager~0.offset_127, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_84|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_65|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_41|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_32|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_30|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~manager_back~0=v_~manager_back~0_201, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_94|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~node~0.offset=v_~node~0.offset_71, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_33|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_69|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_119|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ~manager~0.base=v_~manager~0.base_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_19|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_85|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_326|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_119|, ~manager_size~0=v_~manager_size~0_128, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~ret29#1.offset, ~manager_front~0, ULTIMATE.start_main_#t~nondet30#1, ~node_size~0, ~client_front~0, #length, ULTIMATE.start_main_#t~ret26#1.offset, ~client~0.base, ~update~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ~node~0.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~mem42#1, ~safe~0, ULTIMATE.start_main_#t~mem41#1, ~client_size~0, ~node_front~0, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~nondet28#1, ~client_back~0, ~client~0.offset, ULTIMATE.start_main_#t~ret32#1.base, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ~manager_back~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ~manager~0.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, ~manager_size~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1713#[L158-6]don't care [1217] L158-6-->L158-14: Formula: (and (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_In_1| v_~client_size~0_Out_2) (= 0 (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~manager~0.offset_Out_2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_7|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (= |v_ULTIMATE.start_main_#t~nondet27#1_In_1| v_~client_front~0_Out_2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7| v_~manager~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~client_back~0_Out_2 v_~client_front~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= v_~client_size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_In_1|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_In_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~client_back~0=v_~client_back~0_Out_2, ~manager~0.offset=v_~manager~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ~client_front~0=v_~client_front~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ~manager~0.base=v_~manager~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_Out_6|, #valid=|v_#valid_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_Out_18|, ~client_size~0=v_~client_size~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client_back~0, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~manager~0.base, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~client_front~0, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~client_size~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] 1665#[L158-14]don't care [1213] L158-14-->L158-22: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet30#1_33| v_~node_front~0_92) (= (store |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 1) |v_#valid_405|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 0)) (= (select |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147| |v_ULTIMATE.start_create_fresh_int_array_~size#1_189|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| |v_#StackHeapBarrier_68|) (= v_~client~0.base_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|) (= v_~node_back~0_110 v_~node_front~0_92) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) (= (store |v_#length_359| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4)) |v_#length_358|) (= v_~client~0.offset_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139| 0) (= |v_ULTIMATE.start_main_#t~nondet31#1_33| v_~node_size~0_70) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| v_~node_size~0_70) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4294967296) 1073741823) 1 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147|, #valid=|v_#valid_406|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_33|, #length=|v_#length_359|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_189|} OutVars{~node_back~0=v_~node_back~0_110, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139|, ~client~0.offset=v_~client~0.offset_47, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_78|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51|, ~node_size~0=v_~node_size~0_70, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|, #length=|v_#length_358|, ~client~0.base=v_~client~0.base_47, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_188|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_79|, #valid=|v_#valid_405|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_107|, ~node_front~0=v_~node_front~0_92, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~node_size~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~node_front~0, ~client~0.base, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1575#[L158-22]don't care [2022-07-22 12:21:49,795 INFO L750 eck$LassoCheckResult]: Loop: 1575#[L158-22]don't care [1169] L158-22-->L158-22: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 1)) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0 4) (select |v_#length_286| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|)) (= |v_#memory_int_274| (store |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| (store (select |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|))) (= (select |v_#valid_323| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_132|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_275|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_55|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_274|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #memory_int] 1575#[L158-22]don't care [2022-07-22 12:21:49,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:49,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1239229, now seen corresponding path program 1 times [2022-07-22 12:21:49,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:49,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752628455] [2022-07-22 12:21:49,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:49,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:49,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:49,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1200, now seen corresponding path program 1 times [2022-07-22 12:21:49,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:49,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953770914] [2022-07-22 12:21:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:49,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:49,868 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:49,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:49,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash 38417268, now seen corresponding path program 1 times [2022-07-22 12:21:49,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:49,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634062027] [2022-07-22 12:21:49,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:49,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:49,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:51,688 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-22 12:21:52,501 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:21:52,501 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:21:52,502 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:21:52,502 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:21:52,502 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:21:52,502 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:52,502 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:21:52,502 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:21:52,502 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-commit-1.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:21:52,502 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:21:52,502 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:21:52,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:52,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:53,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:21:54,207 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:21:54,208 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:21:54,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,209 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-22 12:21:54,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:54,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:54,232 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-22 12:21:54,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:54,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,271 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-22 12:21:54,272 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-22 12:21:54,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-22 12:21:54,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:54,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,308 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-22 12:21:54,309 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-22 12:21:54,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:54,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,369 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-22 12:21:54,370 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-22 12:21:54,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:54,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:54,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,405 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-22 12:21:54,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,406 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-22 12:21:54,408 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-22 12:21:54,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:54,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,444 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-22 12:21:54,446 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-22 12:21:54,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,478 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-22 12:21:54,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,480 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-22 12:21:54,481 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-22 12:21:54,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,512 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-22 12:21:54,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,513 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-22 12:21:54,515 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-22 12:21:54,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 12:21:54,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,547 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-22 12:21:54,548 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-22 12:21:54,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:54,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,589 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-22 12:21:54,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:54,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:54,609 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-22 12:21:54,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,631 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-22 12:21:54,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,634 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-22 12:21:54,635 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-22 12:21:54,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:54,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:54,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,669 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-22 12:21:54,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,670 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-22 12:21:54,672 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-22 12:21:54,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:54,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:54,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-22 12:21:54,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,737 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-22 12:21:54,738 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-22 12:21:54,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,770 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-22 12:21:54,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,771 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-22 12:21:54,772 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-22 12:21:54,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:54,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,806 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-22 12:21:54,808 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-22 12:21:54,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:54,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:54,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,842 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-22 12:21:54,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,843 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-22 12:21:54,846 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-22 12:21:54,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:54,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,879 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-22 12:21:54,880 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-22 12:21:54,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:54,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,912 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-22 12:21:54,913 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-22 12:21:54,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-22 12:21:54,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,954 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-22 12:21:54,954 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-22 12:21:54,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:54,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:54,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:54,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:54,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:54,987 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-22 12:21:54,988 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-22 12:21:54,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-22 12:21:54,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:54,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:54,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:54,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:54,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:54,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:54,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:54,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-22 12:21:55,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,021 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-22 12:21:55,027 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-22 12:21:55,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:55,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:55,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:55,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:55,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:55,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,063 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-22 12:21:55,064 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-22 12:21:55,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:21:55,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-22 12:21:55,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,097 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-22 12:21:55,098 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-22 12:21:55,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:21:55,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-22 12:21:55,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,136 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-22 12:21:55,137 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-22 12:21:55,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:55,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-22 12:21:55,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,172 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-22 12:21:55,173 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-22 12:21:55,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:55,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,212 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-22 12:21:55,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,213 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-22 12:21:55,214 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-22 12:21:55,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:21:55,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:55,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:55,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:55,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,246 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-22 12:21:55,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,248 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-22 12:21:55,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:21:55,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,262 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-22 12:21:55,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:55,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,286 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-22 12:21:55,286 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-22 12:21:55,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:55,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:55,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,321 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-22 12:21:55,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:55,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,342 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-22 12:21:55,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,384 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-22 12:21:55,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,385 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-22 12:21:55,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:21:55,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,404 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-22 12:21:55,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-22 12:21:55,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,447 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-22 12:21:55,448 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-22 12:21:55,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:55,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:21:55,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:21:55,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:21:55,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,508 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-22 12:21:55,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,509 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-22 12:21:55,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:55,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,526 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-22 12:21:55,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,560 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-22 12:21:55,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,561 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-22 12:21:55,562 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-22 12:21:55,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:55,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-22 12:21:55,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,600 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-22 12:21:55,601 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-22 12:21:55,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:55,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,645 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-22 12:21:55,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,646 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-22 12:21:55,646 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-22 12:21:55,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:21:55,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-22 12:21:55,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,682 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-22 12:21:55,683 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-22 12:21:55,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:55,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:21:55,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:55,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,730 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:21:55,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-22 12:21:55,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-22 12:21:55,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:21:55,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:21:55,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:21:55,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:21:55,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:21:55,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:21:55,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:21:55,779 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 12:21:55,779 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 12:21:55,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:21:55,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:21:55,781 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:21:55,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-22 12:21:55,783 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:21:55,791 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:21:55,792 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:21:55,792 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:21:55,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-22 12:21:55,980 INFO L257 tatePredicateManager]: 35 out of 35 supporting invariants were superfluous and have been removed [2022-07-22 12:21:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:56,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:21:56,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:21:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:56,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:21:56,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:21:56,051 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-22 12:21:56,052 INFO L142 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-22 12:21:56,052 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 155 states and 486 transitions. cyclomatic complexity: 364 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:21:56,084 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 155 states and 486 transitions. cyclomatic complexity: 364. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 156 states and 488 transitions. Complement of second has 3 states. [2022-07-22 12:21:56,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:21:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:21:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2022-07-22 12:21:56,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:21:56,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:56,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:21:56,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:56,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-22 12:21:56,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:21:56,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 488 transitions. [2022-07-22 12:21:56,097 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 144 [2022-07-22 12:21:56,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 488 transitions. [2022-07-22 12:21:56,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2022-07-22 12:21:56,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2022-07-22 12:21:56,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 488 transitions. [2022-07-22 12:21:56,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:21:56,109 INFO L220 hiAutomatonCegarLoop]: Abstraction has 156 states and 488 transitions. [2022-07-22 12:21:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 488 transitions. [2022-07-22 12:21:56,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-07-22 12:21:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 3.128205128205128) internal successors, (488), 155 states have internal predecessors, (488), 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-22 12:21:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 488 transitions. [2022-07-22 12:21:56,132 INFO L242 hiAutomatonCegarLoop]: Abstraction has 156 states and 488 transitions. [2022-07-22 12:21:56,133 INFO L425 stractBuchiCegarLoop]: Abstraction has 156 states and 488 transitions. [2022-07-22 12:21:56,133 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:21:56,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 488 transitions. [2022-07-22 12:21:56,136 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 144 [2022-07-22 12:21:56,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:56,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:56,137 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:21:56,137 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:21:56,138 INFO L748 eck$LassoCheckResult]: Stem: 2363#[ULTIMATE.startENTRY]don't care [1218] ULTIMATE.startENTRY-->L158-6: Formula: (let ((.cse1 (store |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (let ((.cse2 (select |v_#memory_int_326| 1)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75| 1))) (and (= v_~node~0.base_71 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) (= v_~client~0.base_51 0) (= v_~manager_back~0_201 v_~manager_front~0_188) (= v_~manager_size~0_128 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|) (= |v_#NULL.base_12| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75|) 0) (= v_~ok~0_99 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57| |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) (= (select |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) 1 0))) (= (select |v_#valid_423| 2) 1) (= v_~node~0.offset_71 0) (= v_~manager~0.offset_127 0) (= v_~node_back~0_114 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|) (= (store (store (store (store |v_#length_376| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_75| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4)) |v_#length_374|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_65| 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (= v_~manager~0.base_127 0) (= (select .cse2 1) 0) (= v_~node_size~0_74 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|) (= v_~client_size~0_74 0) (= v_~client~0.offset_51 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4294967296) 1073741823) 1 0)) (< 0 |v_#StackHeapBarrier_76|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_75| 0) (= |v_#valid_421| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= (select |v_#valid_423| 0) 0) (= (select .cse2 0) 48) (= (select |v_#length_376| 1) 2) (= 0 v_~node_front~0_96) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|) (= v_~safe~0_204 1) (= v_~client_front~0_72 0) (= v_~update~0_123 0) (= (select |v_#valid_423| 1) 1) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= v_~client_back~0_92 0) (= 22 (select |v_#length_376| 2)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_76|, #valid=|v_#valid_423|, #memory_int=|v_#memory_int_326|, #length=|v_#length_376|} OutVars{~node_back~0=v_~node_back~0_114, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_51|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_28|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_37|, ~manager_front~0=v_~manager_front~0_188, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~node_size~0=v_~node_size~0_74, ~client_front~0=v_~client_front~0_72, #length=|v_#length_374|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_41|, ~client~0.base=v_~client~0.base_51, ~update~0=v_~update~0_123, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~ok~0=v_~ok~0_99, ~node~0.base=v_~node~0.base_71, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_198|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_34|, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_22|, ~safe~0=v_~safe~0_204, ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_22|, ~client_size~0=v_~client_size~0_74, ~node_front~0=v_~node_front~0_96, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_37|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_44|, ~client_back~0=v_~client_back~0_92, ~client~0.offset=v_~client~0.offset_51, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_33|, ~manager~0.offset=v_~manager~0.offset_127, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_84|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_65|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_41|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_32|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_30|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~manager_back~0=v_~manager_back~0_201, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_94|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~node~0.offset=v_~node~0.offset_71, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_33|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_69|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_119|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ~manager~0.base=v_~manager~0.base_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_19|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_85|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_326|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_119|, ~manager_size~0=v_~manager_size~0_128, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~ret29#1.offset, ~manager_front~0, ULTIMATE.start_main_#t~nondet30#1, ~node_size~0, ~client_front~0, #length, ULTIMATE.start_main_#t~ret26#1.offset, ~client~0.base, ~update~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ~node~0.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~mem42#1, ~safe~0, ULTIMATE.start_main_#t~mem41#1, ~client_size~0, ~node_front~0, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~nondet28#1, ~client_back~0, ~client~0.offset, ULTIMATE.start_main_#t~ret32#1.base, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ~manager_back~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ~manager~0.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, ~manager_size~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2349#[L158-6]don't care [1217] L158-6-->L158-14: Formula: (and (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_In_1| v_~client_size~0_Out_2) (= 0 (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~manager~0.offset_Out_2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_7|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (= |v_ULTIMATE.start_main_#t~nondet27#1_In_1| v_~client_front~0_Out_2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7| v_~manager~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~client_back~0_Out_2 v_~client_front~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= v_~client_size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_In_1|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_In_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~client_back~0=v_~client_back~0_Out_2, ~manager~0.offset=v_~manager~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ~client_front~0=v_~client_front~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ~manager~0.base=v_~manager~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_Out_6|, #valid=|v_#valid_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_Out_18|, ~client_size~0=v_~client_size~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client_back~0, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~manager~0.base, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~client_front~0, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~client_size~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] 2301#[L158-14]don't care [1213] L158-14-->L158-22: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet30#1_33| v_~node_front~0_92) (= (store |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 1) |v_#valid_405|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 0)) (= (select |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147| |v_ULTIMATE.start_create_fresh_int_array_~size#1_189|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| |v_#StackHeapBarrier_68|) (= v_~client~0.base_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|) (= v_~node_back~0_110 v_~node_front~0_92) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) (= (store |v_#length_359| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4)) |v_#length_358|) (= v_~client~0.offset_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139| 0) (= |v_ULTIMATE.start_main_#t~nondet31#1_33| v_~node_size~0_70) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| v_~node_size~0_70) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4294967296) 1073741823) 1 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147|, #valid=|v_#valid_406|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_33|, #length=|v_#length_359|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_189|} OutVars{~node_back~0=v_~node_back~0_110, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139|, ~client~0.offset=v_~client~0.offset_47, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_78|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51|, ~node_size~0=v_~node_size~0_70, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|, #length=|v_#length_358|, ~client~0.base=v_~client~0.base_47, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_188|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_79|, #valid=|v_#valid_405|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_107|, ~node_front~0=v_~node_front~0_92, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~node_size~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~node_front~0, ~client~0.base, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2197#[L158-22]don't care [1207] L158-22-->L140-3: Formula: (and (= v_~node~0.offset_67 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|) (= (select |v_#valid_395| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1) (= |v_ULTIMATE.start_main_#t~pre35#1_43| |v_#pthreadsForks_121|) (= |v_ULTIMATE.start_main_#t~nondet33#1_29| v_~ok~0_95) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| v_~node~0.base_67) (= v_~update~0_119 |v_ULTIMATE.start_main_#t~nondet34#1_27|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140| |v_ULTIMATE.start_create_fresh_int_array_~size#1_184|)) (= (+ |v_#pthreadsForks_121| 1) |v_#pthreadsForks_120|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_352| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= (store |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre35#1_43|)) |v_#memory_int_320|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_121|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, #valid=|v_#valid_395|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_27|, #memory_int=|v_#memory_int_321|, #length=|v_#length_352|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_29|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_43|, ~ok~0=v_~ok~0_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, ~node~0.base=v_~node~0.base_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ~node~0.offset=v_~node~0.offset_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|, #pthreadsForks=|v_#pthreadsForks_120|, #valid=|v_#valid_395|, #memory_int=|v_#memory_int_320|, #length=|v_#length_352|, ~update~0=v_~update~0_119, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret32#1.base, ULTIMATE.start_main_#t~pre35#1, ~ok~0, ULTIMATE.start_main_#t~nondet34#1, ~node~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ~update~0, ULTIMATE.start_main_#t~ret32#1.offset] 2201#[L140-3]don't care [967] L140-3-->L74: Formula: (and (= |v_ULTIMATE.start_main_#t~pre35#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_4|, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_4|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_10|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_4|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_4|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 2171#[L74, L140-4]don't care [2022-07-22 12:21:56,139 INFO L750 eck$LassoCheckResult]: Loop: 2171#[L74, L140-4]don't care [1121] L74-->L56: Formula: (let ((.cse1 (not |v_thread1_#t~short3#1_64|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (= (ite (and (< v_~manager_front~0_125 v_~manager_back~0_135) (< v_~manager_front~0_125 v_~manager_size~0_70) (<= 0 v_~manager_front~0_125)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (let ((.cse0 (= 0 (mod v_~safe~0_119 256)))) (or (and (not .cse0) |v_thread1_#t~short3#1_64|) (and .cse1 .cse0))) (not (= (mod |v_thread1Thread1of1ForFork2_#t~nondet1#1_18| 256) 0)) (= v_~manager_front~0_124 (+ v_~manager_front~0_125 1)) (= v_~safe~0_118 (ite (= (ite |v_thread1_#t~short3#1_63| 1 0) 0) 0 1)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| 0)) (or (let ((.cse4 (* v_~manager_front~0_125 4))) (let ((.cse3 (+ .cse4 v_~manager~0.offset_75))) (and (let ((.cse2 (= |v_thread1_#t~mem2#1_36| v_~update~0_75))) (or (and (not .cse2) (not |v_thread1_#t~short3#1_63|)) (and .cse2 |v_thread1_#t~short3#1_63|))) (= |v_thread1_#t~mem2#1_36| (select (select |v_#memory_int_224| v_~manager~0.base_75) .cse3)) (<= (+ .cse4 4 v_~manager~0.offset_75) (select |v_#length_224| v_~manager~0.base_75)) |v_thread1_#t~short3#1_64| (<= 0 .cse3) (= (select |v_#valid_257| v_~manager~0.base_75) 1)))) (and .cse1 (= |v_thread1_#t~short3#1_63| |v_thread1_#t~short3#1_64|) (= |v_thread1_#t~mem2#1_36| |v_thread1Thread1of1ForFork2_#t~mem2#1_22|))))) InVars {~manager_front~0=v_~manager_front~0_125, ~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~safe~0=v_~safe~0_119, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_22|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_18|, ~manager_back~0=v_~manager_back~0_135, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, ~update~0=v_~update~0_75} OutVars{~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~manager_back~0=v_~manager_back~0_135, ~manager_front~0=v_~manager_front~0_124, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|, ~safe~0=v_~safe~0_118, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_13|, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_13|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39|, ~update~0=v_~update~0_75} AuxVars[|v_thread1_#t~mem2#1_36|, |v_thread1_#t~short3#1_64|, |v_thread1_#t~short3#1_63|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 2173#[L140-4, L56]don't care [938] L56-->L62: Formula: (let ((.cse0 (* v_~node_back~0_49 4))) (let ((.cse1 (+ .cse0 v_~node~0.offset_21))) (and (= (select |v_#valid_99| v_~node~0.base_21) 1) (<= (+ .cse0 v_~node~0.offset_21 4) (select |v_#length_92| v_~node~0.base_21)) (not (= (ite (and (< v_~node_back~0_49 v_~node_size~0_16) (<= 0 v_~node_back~0_49)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_86| v_~node~0.base_21) .cse1) v_~update~0_31) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= v_~node_back~0_48 (+ v_~node_back~0_49 1)) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))))) InVars {~node_back~0=v_~node_back~0_49, ~node_size~0=v_~node_size~0_16, #valid=|v_#valid_99|, ~node~0.base=v_~node~0.base_21, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, ~node~0.offset=v_~node~0.offset_21, ~update~0=v_~update~0_31} OutVars{~node_back~0=v_~node_back~0_48, ~node~0.base=v_~node~0.base_21, ~node~0.offset=v_~node~0.offset_21, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_1|, ~node_size~0=v_~node_size~0_16, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_1|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~update~0=v_~update~0_31} AuxVars[] AssignedVars[~node_back~0, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 2241#[L62, L140-4]don't care [939] L62-->L68: Formula: (let ((.cse1 (not |v_thread1_#t~short8#1_45|))) (and (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (= v_~manager_front~0_80 (+ v_~manager_front~0_81 1)) (= v_~safe~0_68 (ite (= (ite |v_thread1_#t~short8#1_46| 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= (ite (and (<= 0 v_~manager_front~0_81) (< v_~manager_front~0_81 v_~manager_back~0_107) (< v_~manager_front~0_81 v_~manager_size~0_42)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|) (let ((.cse0 (= (mod v_~safe~0_69 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) |v_thread1_#t~short8#1_45|))) (or (and (= |v_thread1_#t~mem7#1_28| |v_thread1Thread1of1ForFork2_#t~mem7#1_1|) (= |v_thread1_#t~short8#1_45| |v_thread1_#t~short8#1_46|) .cse1) (let ((.cse3 (* v_~manager_front~0_81 4))) (let ((.cse4 (+ .cse3 v_~manager~0.offset_49))) (and (let ((.cse2 (= |v_thread1_#t~mem7#1_28| v_~ok~0_43))) (or (and (not .cse2) (not |v_thread1_#t~short8#1_46|)) (and .cse2 |v_thread1_#t~short8#1_46|))) (= (select |v_#valid_119| v_~manager~0.base_49) 1) (<= (+ 4 .cse3 v_~manager~0.offset_49) (select |v_#length_112| v_~manager~0.base_49)) (= |v_thread1_#t~mem7#1_28| (select (select |v_#memory_int_106| v_~manager~0.base_49) .cse4)) (<= 0 .cse4) |v_thread1_#t~short8#1_45|)))))) InVars {~manager_front~0=v_~manager_front~0_81, ~manager~0.offset=v_~manager~0.offset_49, ~ok~0=v_~ok~0_43, ~manager~0.base=v_~manager~0.base_49, #valid=|v_#valid_119|, ~safe~0=v_~safe~0_69, #memory_int=|v_#memory_int_106|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_1|, #length=|v_#length_112|, ~manager_back~0=v_~manager_back~0_107, ~manager_size~0=v_~manager_size~0_42} OutVars{~manager~0.offset=v_~manager~0.offset_49, ~ok~0=v_~ok~0_43, ~manager~0.base=v_~manager~0.base_49, ~manager_back~0=v_~manager_back~0_107, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_1|, ~manager_front~0=v_~manager_front~0_80, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~safe~0=v_~safe~0_68, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_106|, #length=|v_#length_112|, ~manager_size~0=v_~manager_size~0_42, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|} AuxVars[|v_thread1_#t~short8#1_45|, |v_thread1_#t~short8#1_46|, |v_thread1_#t~mem7#1_28|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 2243#[L140-4, L68]don't care [940] L68-->L74: Formula: (let ((.cse0 (* v_~client_back~0_51 4))) (let ((.cse1 (+ v_~client~0.offset_21 .cse0))) (and (<= (+ v_~client~0.offset_21 4 .cse0) (select |v_#length_116| v_~client~0.base_21)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|) (<= 0 .cse1) (= (select |v_#valid_123| v_~client~0.base_21) 1) (= (ite (= (select (select |v_#memory_int_110| v_~client~0.base_21) .cse1) v_~ok~0_47) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= (+ v_~client_back~0_51 1) v_~client_back~0_50) (not (= (ite (and (<= 0 v_~client_back~0_51) (< v_~client_back~0_51 v_~client_size~0_30)) 1 0) 0))))) InVars {~client_back~0=v_~client_back~0_51, ~client~0.offset=v_~client~0.offset_21, ~ok~0=v_~ok~0_47, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_110|, #length=|v_#length_116|, ~client_size~0=v_~client_size~0_30, ~client~0.base=v_~client~0.base_21} OutVars{~client_back~0=v_~client_back~0_50, ~client~0.offset=v_~client~0.offset_21, ~ok~0=v_~ok~0_47, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_1|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_110|, #length=|v_#length_116|, ~client_size~0=v_~client_size~0_30, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~client~0.base=v_~client~0.base_21} AuxVars[] AssignedVars[~client_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 2171#[L74, L140-4]don't care [2022-07-22 12:21:56,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:56,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1190937453, now seen corresponding path program 1 times [2022-07-22 12:21:56,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:56,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30443712] [2022-07-22 12:21:56,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:56,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:56,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:56,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:56,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash 35250699, now seen corresponding path program 1 times [2022-07-22 12:21:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:56,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695790835] [2022-07-22 12:21:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:56,265 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:56,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:56,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:56,321 INFO L85 PathProgramCache]: Analyzing trace with hash 556699511, now seen corresponding path program 1 times [2022-07-22 12:21:56,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:56,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411053779] [2022-07-22 12:21:56,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:56,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:56,476 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-22 12:21:56,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:21:56,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411053779] [2022-07-22 12:21:56,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411053779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:21:56,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:21:56,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:21:56,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402690559] [2022-07-22 12:21:56,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:21:56,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-07-22 12:21:57,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:21:57,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:21:57,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:21:57,904 INFO L87 Difference]: Start difference. First operand 156 states and 488 transitions. cyclomatic complexity: 365 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:21:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:21:58,039 INFO L93 Difference]: Finished difference Result 223 states and 646 transitions. [2022-07-22 12:21:58,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 646 transitions. [2022-07-22 12:21:58,044 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 180 [2022-07-22 12:21:58,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 211 states and 617 transitions. [2022-07-22 12:21:58,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2022-07-22 12:21:58,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2022-07-22 12:21:58,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 617 transitions. [2022-07-22 12:21:58,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:21:58,052 INFO L220 hiAutomatonCegarLoop]: Abstraction has 211 states and 617 transitions. [2022-07-22 12:21:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 617 transitions. [2022-07-22 12:21:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 197. [2022-07-22 12:21:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 197 states have (on average 3.010152284263959) internal successors, (593), 196 states have internal predecessors, (593), 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-22 12:21:58,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 593 transitions. [2022-07-22 12:21:58,086 INFO L242 hiAutomatonCegarLoop]: Abstraction has 197 states and 593 transitions. [2022-07-22 12:21:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:21:58,087 INFO L425 stractBuchiCegarLoop]: Abstraction has 197 states and 593 transitions. [2022-07-22 12:21:58,087 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:21:58,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 197 states and 593 transitions. [2022-07-22 12:21:58,091 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 168 [2022-07-22 12:21:58,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:58,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:58,092 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:21:58,092 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:21:58,093 INFO L748 eck$LassoCheckResult]: Stem: 2965#[ULTIMATE.startENTRY]don't care [1218] ULTIMATE.startENTRY-->L158-6: Formula: (let ((.cse1 (store |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (let ((.cse2 (select |v_#memory_int_326| 1)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75| 1))) (and (= v_~node~0.base_71 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) (= v_~client~0.base_51 0) (= v_~manager_back~0_201 v_~manager_front~0_188) (= v_~manager_size~0_128 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|) (= |v_#NULL.base_12| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75|) 0) (= v_~ok~0_99 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57| |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) (= (select |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) 1 0))) (= (select |v_#valid_423| 2) 1) (= v_~node~0.offset_71 0) (= v_~manager~0.offset_127 0) (= v_~node_back~0_114 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|) (= (store (store (store (store |v_#length_376| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_75| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4)) |v_#length_374|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_65| 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (= v_~manager~0.base_127 0) (= (select .cse2 1) 0) (= v_~node_size~0_74 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|) (= v_~client_size~0_74 0) (= v_~client~0.offset_51 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4294967296) 1073741823) 1 0)) (< 0 |v_#StackHeapBarrier_76|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_75| 0) (= |v_#valid_421| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= (select |v_#valid_423| 0) 0) (= (select .cse2 0) 48) (= (select |v_#length_376| 1) 2) (= 0 v_~node_front~0_96) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|) (= v_~safe~0_204 1) (= v_~client_front~0_72 0) (= v_~update~0_123 0) (= (select |v_#valid_423| 1) 1) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= v_~client_back~0_92 0) (= 22 (select |v_#length_376| 2)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_76|, #valid=|v_#valid_423|, #memory_int=|v_#memory_int_326|, #length=|v_#length_376|} OutVars{~node_back~0=v_~node_back~0_114, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_51|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_28|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_37|, ~manager_front~0=v_~manager_front~0_188, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~node_size~0=v_~node_size~0_74, ~client_front~0=v_~client_front~0_72, #length=|v_#length_374|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_41|, ~client~0.base=v_~client~0.base_51, ~update~0=v_~update~0_123, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~ok~0=v_~ok~0_99, ~node~0.base=v_~node~0.base_71, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_198|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_34|, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_22|, ~safe~0=v_~safe~0_204, ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_22|, ~client_size~0=v_~client_size~0_74, ~node_front~0=v_~node_front~0_96, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_37|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_44|, ~client_back~0=v_~client_back~0_92, ~client~0.offset=v_~client~0.offset_51, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_33|, ~manager~0.offset=v_~manager~0.offset_127, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_84|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_65|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_41|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_32|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_30|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~manager_back~0=v_~manager_back~0_201, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_94|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~node~0.offset=v_~node~0.offset_71, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_33|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_69|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_119|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ~manager~0.base=v_~manager~0.base_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_19|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_85|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_326|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_119|, ~manager_size~0=v_~manager_size~0_128, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~ret29#1.offset, ~manager_front~0, ULTIMATE.start_main_#t~nondet30#1, ~node_size~0, ~client_front~0, #length, ULTIMATE.start_main_#t~ret26#1.offset, ~client~0.base, ~update~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ~node~0.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~mem42#1, ~safe~0, ULTIMATE.start_main_#t~mem41#1, ~client_size~0, ~node_front~0, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~nondet28#1, ~client_back~0, ~client~0.offset, ULTIMATE.start_main_#t~ret32#1.base, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ~manager_back~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ~manager~0.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, ~manager_size~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2929#[L158-6]don't care [1217] L158-6-->L158-14: Formula: (and (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_In_1| v_~client_size~0_Out_2) (= 0 (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~manager~0.offset_Out_2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_7|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (= |v_ULTIMATE.start_main_#t~nondet27#1_In_1| v_~client_front~0_Out_2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7| v_~manager~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~client_back~0_Out_2 v_~client_front~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= v_~client_size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_In_1|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_In_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~client_back~0=v_~client_back~0_Out_2, ~manager~0.offset=v_~manager~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ~client_front~0=v_~client_front~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ~manager~0.base=v_~manager~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_Out_6|, #valid=|v_#valid_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_Out_18|, ~client_size~0=v_~client_size~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client_back~0, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~manager~0.base, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~client_front~0, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~client_size~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] 2867#[L158-14]don't care [1213] L158-14-->L158-22: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet30#1_33| v_~node_front~0_92) (= (store |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 1) |v_#valid_405|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 0)) (= (select |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147| |v_ULTIMATE.start_create_fresh_int_array_~size#1_189|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| |v_#StackHeapBarrier_68|) (= v_~client~0.base_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|) (= v_~node_back~0_110 v_~node_front~0_92) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) (= (store |v_#length_359| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4)) |v_#length_358|) (= v_~client~0.offset_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139| 0) (= |v_ULTIMATE.start_main_#t~nondet31#1_33| v_~node_size~0_70) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| v_~node_size~0_70) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4294967296) 1073741823) 1 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147|, #valid=|v_#valid_406|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_33|, #length=|v_#length_359|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_189|} OutVars{~node_back~0=v_~node_back~0_110, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139|, ~client~0.offset=v_~client~0.offset_47, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_78|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51|, ~node_size~0=v_~node_size~0_70, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|, #length=|v_#length_358|, ~client~0.base=v_~client~0.base_47, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_188|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_79|, #valid=|v_#valid_405|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_107|, ~node_front~0=v_~node_front~0_92, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~node_size~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~node_front~0, ~client~0.base, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2749#[L158-22]don't care [1169] L158-22-->L158-22: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 1)) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0 4) (select |v_#length_286| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|)) (= |v_#memory_int_274| (store |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| (store (select |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|))) (= (select |v_#valid_323| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_132|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_275|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_55|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_274|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #memory_int] 2751#[L158-22]don't care [1207] L158-22-->L140-3: Formula: (and (= v_~node~0.offset_67 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|) (= (select |v_#valid_395| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1) (= |v_ULTIMATE.start_main_#t~pre35#1_43| |v_#pthreadsForks_121|) (= |v_ULTIMATE.start_main_#t~nondet33#1_29| v_~ok~0_95) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| v_~node~0.base_67) (= v_~update~0_119 |v_ULTIMATE.start_main_#t~nondet34#1_27|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140| |v_ULTIMATE.start_create_fresh_int_array_~size#1_184|)) (= (+ |v_#pthreadsForks_121| 1) |v_#pthreadsForks_120|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_352| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= (store |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre35#1_43|)) |v_#memory_int_320|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_121|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, #valid=|v_#valid_395|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_27|, #memory_int=|v_#memory_int_321|, #length=|v_#length_352|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_29|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_43|, ~ok~0=v_~ok~0_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, ~node~0.base=v_~node~0.base_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ~node~0.offset=v_~node~0.offset_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|, #pthreadsForks=|v_#pthreadsForks_120|, #valid=|v_#valid_395|, #memory_int=|v_#memory_int_320|, #length=|v_#length_352|, ~update~0=v_~update~0_119, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret32#1.base, ULTIMATE.start_main_#t~pre35#1, ~ok~0, ULTIMATE.start_main_#t~nondet34#1, ~node~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ~update~0, ULTIMATE.start_main_#t~ret32#1.offset] 2755#[L140-3]don't care [967] L140-3-->L74: Formula: (and (= |v_ULTIMATE.start_main_#t~pre35#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_4|, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_4|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_10|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_4|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_4|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 2951#[L74, L140-4]don't care [2022-07-22 12:21:58,094 INFO L750 eck$LassoCheckResult]: Loop: 2951#[L74, L140-4]don't care [1121] L74-->L56: Formula: (let ((.cse1 (not |v_thread1_#t~short3#1_64|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (= (ite (and (< v_~manager_front~0_125 v_~manager_back~0_135) (< v_~manager_front~0_125 v_~manager_size~0_70) (<= 0 v_~manager_front~0_125)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (let ((.cse0 (= 0 (mod v_~safe~0_119 256)))) (or (and (not .cse0) |v_thread1_#t~short3#1_64|) (and .cse1 .cse0))) (not (= (mod |v_thread1Thread1of1ForFork2_#t~nondet1#1_18| 256) 0)) (= v_~manager_front~0_124 (+ v_~manager_front~0_125 1)) (= v_~safe~0_118 (ite (= (ite |v_thread1_#t~short3#1_63| 1 0) 0) 0 1)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| 0)) (or (let ((.cse4 (* v_~manager_front~0_125 4))) (let ((.cse3 (+ .cse4 v_~manager~0.offset_75))) (and (let ((.cse2 (= |v_thread1_#t~mem2#1_36| v_~update~0_75))) (or (and (not .cse2) (not |v_thread1_#t~short3#1_63|)) (and .cse2 |v_thread1_#t~short3#1_63|))) (= |v_thread1_#t~mem2#1_36| (select (select |v_#memory_int_224| v_~manager~0.base_75) .cse3)) (<= (+ .cse4 4 v_~manager~0.offset_75) (select |v_#length_224| v_~manager~0.base_75)) |v_thread1_#t~short3#1_64| (<= 0 .cse3) (= (select |v_#valid_257| v_~manager~0.base_75) 1)))) (and .cse1 (= |v_thread1_#t~short3#1_63| |v_thread1_#t~short3#1_64|) (= |v_thread1_#t~mem2#1_36| |v_thread1Thread1of1ForFork2_#t~mem2#1_22|))))) InVars {~manager_front~0=v_~manager_front~0_125, ~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~safe~0=v_~safe~0_119, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_22|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_18|, ~manager_back~0=v_~manager_back~0_135, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, ~update~0=v_~update~0_75} OutVars{~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~manager_back~0=v_~manager_back~0_135, ~manager_front~0=v_~manager_front~0_124, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|, ~safe~0=v_~safe~0_118, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_13|, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_13|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39|, ~update~0=v_~update~0_75} AuxVars[|v_thread1_#t~mem2#1_36|, |v_thread1_#t~short3#1_64|, |v_thread1_#t~short3#1_63|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 2979#[L140-4, L56]don't care [938] L56-->L62: Formula: (let ((.cse0 (* v_~node_back~0_49 4))) (let ((.cse1 (+ .cse0 v_~node~0.offset_21))) (and (= (select |v_#valid_99| v_~node~0.base_21) 1) (<= (+ .cse0 v_~node~0.offset_21 4) (select |v_#length_92| v_~node~0.base_21)) (not (= (ite (and (< v_~node_back~0_49 v_~node_size~0_16) (<= 0 v_~node_back~0_49)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_86| v_~node~0.base_21) .cse1) v_~update~0_31) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= v_~node_back~0_48 (+ v_~node_back~0_49 1)) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))))) InVars {~node_back~0=v_~node_back~0_49, ~node_size~0=v_~node_size~0_16, #valid=|v_#valid_99|, ~node~0.base=v_~node~0.base_21, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, ~node~0.offset=v_~node~0.offset_21, ~update~0=v_~update~0_31} OutVars{~node_back~0=v_~node_back~0_48, ~node~0.base=v_~node~0.base_21, ~node~0.offset=v_~node~0.offset_21, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_1|, ~node_size~0=v_~node_size~0_16, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_1|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~update~0=v_~update~0_31} AuxVars[] AssignedVars[~node_back~0, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 2789#[L62, L140-4]don't care [939] L62-->L68: Formula: (let ((.cse1 (not |v_thread1_#t~short8#1_45|))) (and (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (= v_~manager_front~0_80 (+ v_~manager_front~0_81 1)) (= v_~safe~0_68 (ite (= (ite |v_thread1_#t~short8#1_46| 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= (ite (and (<= 0 v_~manager_front~0_81) (< v_~manager_front~0_81 v_~manager_back~0_107) (< v_~manager_front~0_81 v_~manager_size~0_42)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|) (let ((.cse0 (= (mod v_~safe~0_69 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) |v_thread1_#t~short8#1_45|))) (or (and (= |v_thread1_#t~mem7#1_28| |v_thread1Thread1of1ForFork2_#t~mem7#1_1|) (= |v_thread1_#t~short8#1_45| |v_thread1_#t~short8#1_46|) .cse1) (let ((.cse3 (* v_~manager_front~0_81 4))) (let ((.cse4 (+ .cse3 v_~manager~0.offset_49))) (and (let ((.cse2 (= |v_thread1_#t~mem7#1_28| v_~ok~0_43))) (or (and (not .cse2) (not |v_thread1_#t~short8#1_46|)) (and .cse2 |v_thread1_#t~short8#1_46|))) (= (select |v_#valid_119| v_~manager~0.base_49) 1) (<= (+ 4 .cse3 v_~manager~0.offset_49) (select |v_#length_112| v_~manager~0.base_49)) (= |v_thread1_#t~mem7#1_28| (select (select |v_#memory_int_106| v_~manager~0.base_49) .cse4)) (<= 0 .cse4) |v_thread1_#t~short8#1_45|)))))) InVars {~manager_front~0=v_~manager_front~0_81, ~manager~0.offset=v_~manager~0.offset_49, ~ok~0=v_~ok~0_43, ~manager~0.base=v_~manager~0.base_49, #valid=|v_#valid_119|, ~safe~0=v_~safe~0_69, #memory_int=|v_#memory_int_106|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_1|, #length=|v_#length_112|, ~manager_back~0=v_~manager_back~0_107, ~manager_size~0=v_~manager_size~0_42} OutVars{~manager~0.offset=v_~manager~0.offset_49, ~ok~0=v_~ok~0_43, ~manager~0.base=v_~manager~0.base_49, ~manager_back~0=v_~manager_back~0_107, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_1|, ~manager_front~0=v_~manager_front~0_80, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~safe~0=v_~safe~0_68, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_106|, #length=|v_#length_112|, ~manager_size~0=v_~manager_size~0_42, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|} AuxVars[|v_thread1_#t~short8#1_45|, |v_thread1_#t~short8#1_46|, |v_thread1_#t~mem7#1_28|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 2791#[L140-4, L68]don't care [940] L68-->L74: Formula: (let ((.cse0 (* v_~client_back~0_51 4))) (let ((.cse1 (+ v_~client~0.offset_21 .cse0))) (and (<= (+ v_~client~0.offset_21 4 .cse0) (select |v_#length_116| v_~client~0.base_21)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|) (<= 0 .cse1) (= (select |v_#valid_123| v_~client~0.base_21) 1) (= (ite (= (select (select |v_#memory_int_110| v_~client~0.base_21) .cse1) v_~ok~0_47) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= (+ v_~client_back~0_51 1) v_~client_back~0_50) (not (= (ite (and (<= 0 v_~client_back~0_51) (< v_~client_back~0_51 v_~client_size~0_30)) 1 0) 0))))) InVars {~client_back~0=v_~client_back~0_51, ~client~0.offset=v_~client~0.offset_21, ~ok~0=v_~ok~0_47, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_110|, #length=|v_#length_116|, ~client_size~0=v_~client_size~0_30, ~client~0.base=v_~client~0.base_21} OutVars{~client_back~0=v_~client_back~0_50, ~client~0.offset=v_~client~0.offset_21, ~ok~0=v_~ok~0_47, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_1|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_110|, #length=|v_#length_116|, ~client_size~0=v_~client_size~0_30, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~client~0.base=v_~client~0.base_21} AuxVars[] AssignedVars[~client_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 2951#[L74, L140-4]don't care [2022-07-22 12:21:58,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1735672732, now seen corresponding path program 1 times [2022-07-22 12:21:58,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:58,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409332873] [2022-07-22 12:21:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:58,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:58,148 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:58,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:58,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:58,215 INFO L85 PathProgramCache]: Analyzing trace with hash 35250699, now seen corresponding path program 2 times [2022-07-22 12:21:58,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:58,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159091601] [2022-07-22 12:21:58,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:58,247 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:58,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1143294738, now seen corresponding path program 1 times [2022-07-22 12:21:58,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:58,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446127384] [2022-07-22 12:21:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:58,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:21:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:21:58,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:21:58,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446127384] [2022-07-22 12:21:58,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446127384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:21:58,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:21:58,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:21:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521208065] [2022-07-22 12:21:58,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:21:59,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:21:59,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:21:59,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:21:59,723 INFO L87 Difference]: Start difference. First operand 197 states and 593 transitions. cyclomatic complexity: 441 Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:21:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:21:59,849 INFO L93 Difference]: Finished difference Result 389 states and 1101 transitions. [2022-07-22 12:21:59,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 389 states and 1101 transitions. [2022-07-22 12:21:59,855 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 260 [2022-07-22 12:21:59,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 389 states to 302 states and 881 transitions. [2022-07-22 12:21:59,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 298 [2022-07-22 12:21:59,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 298 [2022-07-22 12:21:59,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 881 transitions. [2022-07-22 12:21:59,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:21:59,862 INFO L220 hiAutomatonCegarLoop]: Abstraction has 302 states and 881 transitions. [2022-07-22 12:21:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 881 transitions. [2022-07-22 12:21:59,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 294. [2022-07-22 12:21:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 294 states have (on average 2.9489795918367347) internal successors, (867), 293 states have internal predecessors, (867), 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-22 12:21:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 867 transitions. [2022-07-22 12:21:59,874 INFO L242 hiAutomatonCegarLoop]: Abstraction has 294 states and 867 transitions. [2022-07-22 12:21:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:21:59,878 INFO L425 stractBuchiCegarLoop]: Abstraction has 294 states and 867 transitions. [2022-07-22 12:21:59,878 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:21:59,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 867 transitions. [2022-07-22 12:21:59,882 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 252 [2022-07-22 12:21:59,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:21:59,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:21:59,882 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:21:59,883 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:21:59,884 INFO L748 eck$LassoCheckResult]: Stem: 3815#[ULTIMATE.startENTRY]don't care [1218] ULTIMATE.startENTRY-->L158-6: Formula: (let ((.cse1 (store |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (let ((.cse2 (select |v_#memory_int_326| 1)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75| 1))) (and (= v_~node~0.base_71 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) (= v_~client~0.base_51 0) (= v_~manager_back~0_201 v_~manager_front~0_188) (= v_~manager_size~0_128 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|) (= |v_#NULL.base_12| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75|) 0) (= v_~ok~0_99 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57| |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) (= (select |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) 1 0))) (= (select |v_#valid_423| 2) 1) (= v_~node~0.offset_71 0) (= v_~manager~0.offset_127 0) (= v_~node_back~0_114 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|) (= (store (store (store (store |v_#length_376| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_75| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4)) |v_#length_374|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_65| 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (= v_~manager~0.base_127 0) (= (select .cse2 1) 0) (= v_~node_size~0_74 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|) (= v_~client_size~0_74 0) (= v_~client~0.offset_51 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4294967296) 1073741823) 1 0)) (< 0 |v_#StackHeapBarrier_76|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_75| 0) (= |v_#valid_421| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= (select |v_#valid_423| 0) 0) (= (select .cse2 0) 48) (= (select |v_#length_376| 1) 2) (= 0 v_~node_front~0_96) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|) (= v_~safe~0_204 1) (= v_~client_front~0_72 0) (= v_~update~0_123 0) (= (select |v_#valid_423| 1) 1) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= v_~client_back~0_92 0) (= 22 (select |v_#length_376| 2)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_76|, #valid=|v_#valid_423|, #memory_int=|v_#memory_int_326|, #length=|v_#length_376|} OutVars{~node_back~0=v_~node_back~0_114, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_51|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_28|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_37|, ~manager_front~0=v_~manager_front~0_188, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~node_size~0=v_~node_size~0_74, ~client_front~0=v_~client_front~0_72, #length=|v_#length_374|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_41|, ~client~0.base=v_~client~0.base_51, ~update~0=v_~update~0_123, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~ok~0=v_~ok~0_99, ~node~0.base=v_~node~0.base_71, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_198|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_34|, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_22|, ~safe~0=v_~safe~0_204, ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_22|, ~client_size~0=v_~client_size~0_74, ~node_front~0=v_~node_front~0_96, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_37|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_44|, ~client_back~0=v_~client_back~0_92, ~client~0.offset=v_~client~0.offset_51, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_33|, ~manager~0.offset=v_~manager~0.offset_127, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_84|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_65|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_41|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_32|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_30|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~manager_back~0=v_~manager_back~0_201, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_94|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~node~0.offset=v_~node~0.offset_71, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_33|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_69|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_119|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ~manager~0.base=v_~manager~0.base_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_19|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_85|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_326|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_119|, ~manager_size~0=v_~manager_size~0_128, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~ret29#1.offset, ~manager_front~0, ULTIMATE.start_main_#t~nondet30#1, ~node_size~0, ~client_front~0, #length, ULTIMATE.start_main_#t~ret26#1.offset, ~client~0.base, ~update~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ~node~0.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~mem42#1, ~safe~0, ULTIMATE.start_main_#t~mem41#1, ~client_size~0, ~node_front~0, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~nondet28#1, ~client_back~0, ~client~0.offset, ULTIMATE.start_main_#t~ret32#1.base, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ~manager_back~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ~manager~0.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, ~manager_size~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3753#[L158-6]don't care [1217] L158-6-->L158-14: Formula: (and (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_In_1| v_~client_size~0_Out_2) (= 0 (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~manager~0.offset_Out_2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_7|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (= |v_ULTIMATE.start_main_#t~nondet27#1_In_1| v_~client_front~0_Out_2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7| v_~manager~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~client_back~0_Out_2 v_~client_front~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= v_~client_size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_In_1|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_In_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~client_back~0=v_~client_back~0_Out_2, ~manager~0.offset=v_~manager~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ~client_front~0=v_~client_front~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ~manager~0.base=v_~manager~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_Out_6|, #valid=|v_#valid_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_Out_18|, ~client_size~0=v_~client_size~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client_back~0, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~manager~0.base, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~client_front~0, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~client_size~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] 3663#[L158-14]don't care [1139] L158-14-->L158-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| .cse1))) (and (= (select |v_#valid_277| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|) 1) (= (store |v_#memory_int_243| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61| (store (select |v_#memory_int_243| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_41|)) |v_#memory_int_242|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| 4 .cse1) (select |v_#length_244| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|)) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|) (<= 0 .cse0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| |v_ULTIMATE.start_create_fresh_int_array_~size#1_102|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73|, #valid=|v_#valid_277|, #memory_int=|v_#memory_int_243|, #length=|v_#length_244|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_102|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_43|, #valid=|v_#valid_277|, #memory_int=|v_#memory_int_242|, #length=|v_#length_244|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_102|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #memory_int] 3665#[L158-14]don't care [1213] L158-14-->L158-22: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet30#1_33| v_~node_front~0_92) (= (store |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 1) |v_#valid_405|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 0)) (= (select |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147| |v_ULTIMATE.start_create_fresh_int_array_~size#1_189|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| |v_#StackHeapBarrier_68|) (= v_~client~0.base_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|) (= v_~node_back~0_110 v_~node_front~0_92) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) (= (store |v_#length_359| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4)) |v_#length_358|) (= v_~client~0.offset_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139| 0) (= |v_ULTIMATE.start_main_#t~nondet31#1_33| v_~node_size~0_70) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| v_~node_size~0_70) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4294967296) 1073741823) 1 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147|, #valid=|v_#valid_406|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_33|, #length=|v_#length_359|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_189|} OutVars{~node_back~0=v_~node_back~0_110, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139|, ~client~0.offset=v_~client~0.offset_47, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_78|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51|, ~node_size~0=v_~node_size~0_70, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|, #length=|v_#length_358|, ~client~0.base=v_~client~0.base_47, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_188|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_79|, #valid=|v_#valid_405|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_107|, ~node_front~0=v_~node_front~0_92, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~node_size~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~node_front~0, ~client~0.base, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3545#[L158-22]don't care [1169] L158-22-->L158-22: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 1)) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0 4) (select |v_#length_286| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|)) (= |v_#memory_int_274| (store |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| (store (select |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|))) (= (select |v_#valid_323| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_132|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_275|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_55|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_274|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #memory_int] 3547#[L158-22]don't care [1207] L158-22-->L140-3: Formula: (and (= v_~node~0.offset_67 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|) (= (select |v_#valid_395| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1) (= |v_ULTIMATE.start_main_#t~pre35#1_43| |v_#pthreadsForks_121|) (= |v_ULTIMATE.start_main_#t~nondet33#1_29| v_~ok~0_95) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| v_~node~0.base_67) (= v_~update~0_119 |v_ULTIMATE.start_main_#t~nondet34#1_27|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140| |v_ULTIMATE.start_create_fresh_int_array_~size#1_184|)) (= (+ |v_#pthreadsForks_121| 1) |v_#pthreadsForks_120|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_352| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= (store |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre35#1_43|)) |v_#memory_int_320|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_121|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, #valid=|v_#valid_395|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_27|, #memory_int=|v_#memory_int_321|, #length=|v_#length_352|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_29|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_43|, ~ok~0=v_~ok~0_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, ~node~0.base=v_~node~0.base_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ~node~0.offset=v_~node~0.offset_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|, #pthreadsForks=|v_#pthreadsForks_120|, #valid=|v_#valid_395|, #memory_int=|v_#memory_int_320|, #length=|v_#length_352|, ~update~0=v_~update~0_119, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret32#1.base, ULTIMATE.start_main_#t~pre35#1, ~ok~0, ULTIMATE.start_main_#t~nondet34#1, ~node~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ~update~0, ULTIMATE.start_main_#t~ret32#1.offset] 3551#[L140-3]don't care [967] L140-3-->L74: Formula: (and (= |v_ULTIMATE.start_main_#t~pre35#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_4|, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_4|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_10|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_4|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_4|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 3935#[L74, L140-4]don't care [2022-07-22 12:21:59,885 INFO L750 eck$LassoCheckResult]: Loop: 3935#[L74, L140-4]don't care [1121] L74-->L56: Formula: (let ((.cse1 (not |v_thread1_#t~short3#1_64|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (= (ite (and (< v_~manager_front~0_125 v_~manager_back~0_135) (< v_~manager_front~0_125 v_~manager_size~0_70) (<= 0 v_~manager_front~0_125)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (let ((.cse0 (= 0 (mod v_~safe~0_119 256)))) (or (and (not .cse0) |v_thread1_#t~short3#1_64|) (and .cse1 .cse0))) (not (= (mod |v_thread1Thread1of1ForFork2_#t~nondet1#1_18| 256) 0)) (= v_~manager_front~0_124 (+ v_~manager_front~0_125 1)) (= v_~safe~0_118 (ite (= (ite |v_thread1_#t~short3#1_63| 1 0) 0) 0 1)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| 0)) (or (let ((.cse4 (* v_~manager_front~0_125 4))) (let ((.cse3 (+ .cse4 v_~manager~0.offset_75))) (and (let ((.cse2 (= |v_thread1_#t~mem2#1_36| v_~update~0_75))) (or (and (not .cse2) (not |v_thread1_#t~short3#1_63|)) (and .cse2 |v_thread1_#t~short3#1_63|))) (= |v_thread1_#t~mem2#1_36| (select (select |v_#memory_int_224| v_~manager~0.base_75) .cse3)) (<= (+ .cse4 4 v_~manager~0.offset_75) (select |v_#length_224| v_~manager~0.base_75)) |v_thread1_#t~short3#1_64| (<= 0 .cse3) (= (select |v_#valid_257| v_~manager~0.base_75) 1)))) (and .cse1 (= |v_thread1_#t~short3#1_63| |v_thread1_#t~short3#1_64|) (= |v_thread1_#t~mem2#1_36| |v_thread1Thread1of1ForFork2_#t~mem2#1_22|))))) InVars {~manager_front~0=v_~manager_front~0_125, ~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~safe~0=v_~safe~0_119, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_22|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_18|, ~manager_back~0=v_~manager_back~0_135, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, ~update~0=v_~update~0_75} OutVars{~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~manager_back~0=v_~manager_back~0_135, ~manager_front~0=v_~manager_front~0_124, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|, ~safe~0=v_~safe~0_118, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_13|, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_13|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39|, ~update~0=v_~update~0_75} AuxVars[|v_thread1_#t~mem2#1_36|, |v_thread1_#t~short3#1_64|, |v_thread1_#t~short3#1_63|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 3937#[L140-4, L56]don't care [938] L56-->L62: Formula: (let ((.cse0 (* v_~node_back~0_49 4))) (let ((.cse1 (+ .cse0 v_~node~0.offset_21))) (and (= (select |v_#valid_99| v_~node~0.base_21) 1) (<= (+ .cse0 v_~node~0.offset_21 4) (select |v_#length_92| v_~node~0.base_21)) (not (= (ite (and (< v_~node_back~0_49 v_~node_size~0_16) (<= 0 v_~node_back~0_49)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_86| v_~node~0.base_21) .cse1) v_~update~0_31) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= v_~node_back~0_48 (+ v_~node_back~0_49 1)) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))))) InVars {~node_back~0=v_~node_back~0_49, ~node_size~0=v_~node_size~0_16, #valid=|v_#valid_99|, ~node~0.base=v_~node~0.base_21, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, ~node~0.offset=v_~node~0.offset_21, ~update~0=v_~update~0_31} OutVars{~node_back~0=v_~node_back~0_48, ~node~0.base=v_~node~0.base_21, ~node~0.offset=v_~node~0.offset_21, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_1|, ~node_size~0=v_~node_size~0_16, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_1|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~update~0=v_~update~0_31} AuxVars[] AssignedVars[~node_back~0, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 3953#[L62, L140-4]don't care [939] L62-->L68: Formula: (let ((.cse1 (not |v_thread1_#t~short8#1_45|))) (and (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (= v_~manager_front~0_80 (+ v_~manager_front~0_81 1)) (= v_~safe~0_68 (ite (= (ite |v_thread1_#t~short8#1_46| 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= (ite (and (<= 0 v_~manager_front~0_81) (< v_~manager_front~0_81 v_~manager_back~0_107) (< v_~manager_front~0_81 v_~manager_size~0_42)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|) (let ((.cse0 (= (mod v_~safe~0_69 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) |v_thread1_#t~short8#1_45|))) (or (and (= |v_thread1_#t~mem7#1_28| |v_thread1Thread1of1ForFork2_#t~mem7#1_1|) (= |v_thread1_#t~short8#1_45| |v_thread1_#t~short8#1_46|) .cse1) (let ((.cse3 (* v_~manager_front~0_81 4))) (let ((.cse4 (+ .cse3 v_~manager~0.offset_49))) (and (let ((.cse2 (= |v_thread1_#t~mem7#1_28| v_~ok~0_43))) (or (and (not .cse2) (not |v_thread1_#t~short8#1_46|)) (and .cse2 |v_thread1_#t~short8#1_46|))) (= (select |v_#valid_119| v_~manager~0.base_49) 1) (<= (+ 4 .cse3 v_~manager~0.offset_49) (select |v_#length_112| v_~manager~0.base_49)) (= |v_thread1_#t~mem7#1_28| (select (select |v_#memory_int_106| v_~manager~0.base_49) .cse4)) (<= 0 .cse4) |v_thread1_#t~short8#1_45|)))))) InVars {~manager_front~0=v_~manager_front~0_81, ~manager~0.offset=v_~manager~0.offset_49, ~ok~0=v_~ok~0_43, ~manager~0.base=v_~manager~0.base_49, #valid=|v_#valid_119|, ~safe~0=v_~safe~0_69, #memory_int=|v_#memory_int_106|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_1|, #length=|v_#length_112|, ~manager_back~0=v_~manager_back~0_107, ~manager_size~0=v_~manager_size~0_42} OutVars{~manager~0.offset=v_~manager~0.offset_49, ~ok~0=v_~ok~0_43, ~manager~0.base=v_~manager~0.base_49, ~manager_back~0=v_~manager_back~0_107, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_1|, ~manager_front~0=v_~manager_front~0_80, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~safe~0=v_~safe~0_68, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_106|, #length=|v_#length_112|, ~manager_size~0=v_~manager_size~0_42, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|} AuxVars[|v_thread1_#t~short8#1_45|, |v_thread1_#t~short8#1_46|, |v_thread1_#t~mem7#1_28|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 3947#[L140-4, L68]don't care [940] L68-->L74: Formula: (let ((.cse0 (* v_~client_back~0_51 4))) (let ((.cse1 (+ v_~client~0.offset_21 .cse0))) (and (<= (+ v_~client~0.offset_21 4 .cse0) (select |v_#length_116| v_~client~0.base_21)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|) (<= 0 .cse1) (= (select |v_#valid_123| v_~client~0.base_21) 1) (= (ite (= (select (select |v_#memory_int_110| v_~client~0.base_21) .cse1) v_~ok~0_47) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= (+ v_~client_back~0_51 1) v_~client_back~0_50) (not (= (ite (and (<= 0 v_~client_back~0_51) (< v_~client_back~0_51 v_~client_size~0_30)) 1 0) 0))))) InVars {~client_back~0=v_~client_back~0_51, ~client~0.offset=v_~client~0.offset_21, ~ok~0=v_~ok~0_47, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_110|, #length=|v_#length_116|, ~client_size~0=v_~client_size~0_30, ~client~0.base=v_~client~0.base_21} OutVars{~client_back~0=v_~client_back~0_50, ~client~0.offset=v_~client~0.offset_21, ~ok~0=v_~ok~0_47, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_1|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_110|, #length=|v_#length_116|, ~client_size~0=v_~client_size~0_30, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~client~0.base=v_~client~0.base_21} AuxVars[] AssignedVars[~client_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 3935#[L74, L140-4]don't care [2022-07-22 12:21:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1961662295, now seen corresponding path program 1 times [2022-07-22 12:21:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:59,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476198784] [2022-07-22 12:21:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:59,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:59,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:21:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:21:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash 35250699, now seen corresponding path program 3 times [2022-07-22 12:21:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:21:59,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307777293] [2022-07-22 12:21:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:21:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:21:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:59,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:21:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:21:59,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:00,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:00,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1973345889, now seen corresponding path program 1 times [2022-07-22 12:22:00,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:00,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265362934] [2022-07-22 12:22:00,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:00,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:22:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 12:22:00,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:22:00,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265362934] [2022-07-22 12:22:00,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265362934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:22:00,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:22:00,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:22:00,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022134615] [2022-07-22 12:22:00,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:22:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:22:01,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:22:01,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:22:01,583 INFO L87 Difference]: Start difference. First operand 294 states and 867 transitions. cyclomatic complexity: 661 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:22:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:22:01,770 INFO L93 Difference]: Finished difference Result 379 states and 1037 transitions. [2022-07-22 12:22:01,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 1037 transitions. [2022-07-22 12:22:01,776 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 252 [2022-07-22 12:22:01,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 338 states and 964 transitions. [2022-07-22 12:22:01,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331 [2022-07-22 12:22:01,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331 [2022-07-22 12:22:01,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 964 transitions. [2022-07-22 12:22:01,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:22:01,783 INFO L220 hiAutomatonCegarLoop]: Abstraction has 338 states and 964 transitions. [2022-07-22 12:22:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 964 transitions. [2022-07-22 12:22:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2022-07-22 12:22:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 334 states have (on average 2.8652694610778444) internal successors, (957), 333 states have internal predecessors, (957), 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-22 12:22:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 957 transitions. [2022-07-22 12:22:01,795 INFO L242 hiAutomatonCegarLoop]: Abstraction has 334 states and 957 transitions. [2022-07-22 12:22:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:22:01,796 INFO L425 stractBuchiCegarLoop]: Abstraction has 334 states and 957 transitions. [2022-07-22 12:22:01,796 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:22:01,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 334 states and 957 transitions. [2022-07-22 12:22:01,800 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 252 [2022-07-22 12:22:01,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:22:01,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:22:01,801 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:22:01,801 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:22:01,802 INFO L748 eck$LassoCheckResult]: Stem: 4772#[ULTIMATE.startENTRY]don't care [1218] ULTIMATE.startENTRY-->L158-6: Formula: (let ((.cse1 (store |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (let ((.cse2 (select |v_#memory_int_326| 1)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75| 1))) (and (= v_~node~0.base_71 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) (= v_~client~0.base_51 0) (= v_~manager_back~0_201 v_~manager_front~0_188) (= v_~manager_size~0_128 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|) (= |v_#NULL.base_12| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75|) 0) (= v_~ok~0_99 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57| |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) (= (select |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) 1 0))) (= (select |v_#valid_423| 2) 1) (= v_~node~0.offset_71 0) (= v_~manager~0.offset_127 0) (= v_~node_back~0_114 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|) (= (store (store (store (store |v_#length_376| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_75| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4)) |v_#length_374|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_65| 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (= v_~manager~0.base_127 0) (= (select .cse2 1) 0) (= v_~node_size~0_74 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|) (= v_~client_size~0_74 0) (= v_~client~0.offset_51 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4294967296) 1073741823) 1 0)) (< 0 |v_#StackHeapBarrier_76|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_75| 0) (= |v_#valid_421| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= (select |v_#valid_423| 0) 0) (= (select .cse2 0) 48) (= (select |v_#length_376| 1) 2) (= 0 v_~node_front~0_96) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|) (= v_~safe~0_204 1) (= v_~client_front~0_72 0) (= v_~update~0_123 0) (= (select |v_#valid_423| 1) 1) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= v_~client_back~0_92 0) (= 22 (select |v_#length_376| 2)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_76|, #valid=|v_#valid_423|, #memory_int=|v_#memory_int_326|, #length=|v_#length_376|} OutVars{~node_back~0=v_~node_back~0_114, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_51|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_28|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_37|, ~manager_front~0=v_~manager_front~0_188, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~node_size~0=v_~node_size~0_74, ~client_front~0=v_~client_front~0_72, #length=|v_#length_374|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_41|, ~client~0.base=v_~client~0.base_51, ~update~0=v_~update~0_123, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~ok~0=v_~ok~0_99, ~node~0.base=v_~node~0.base_71, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_198|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_34|, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_22|, ~safe~0=v_~safe~0_204, ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_22|, ~client_size~0=v_~client_size~0_74, ~node_front~0=v_~node_front~0_96, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_37|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_44|, ~client_back~0=v_~client_back~0_92, ~client~0.offset=v_~client~0.offset_51, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_33|, ~manager~0.offset=v_~manager~0.offset_127, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_84|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_65|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_41|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_32|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_30|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~manager_back~0=v_~manager_back~0_201, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_94|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~node~0.offset=v_~node~0.offset_71, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_33|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_69|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_119|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ~manager~0.base=v_~manager~0.base_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_19|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_85|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_326|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_119|, ~manager_size~0=v_~manager_size~0_128, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~ret29#1.offset, ~manager_front~0, ULTIMATE.start_main_#t~nondet30#1, ~node_size~0, ~client_front~0, #length, ULTIMATE.start_main_#t~ret26#1.offset, ~client~0.base, ~update~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ~node~0.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~mem42#1, ~safe~0, ULTIMATE.start_main_#t~mem41#1, ~client_size~0, ~node_front~0, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~nondet28#1, ~client_back~0, ~client~0.offset, ULTIMATE.start_main_#t~ret32#1.base, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ~manager_back~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ~manager~0.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, ~manager_size~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4710#[L158-6]don't care [1144] L158-6-->L158-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67| 4) (select |v_#length_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|)) (= (select |v_#valid_285| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_106|) (<= 0 .cse1) (= (store |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67| (store (select |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|)) |v_#memory_int_246|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_247|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_246|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int] 4712#[L158-6]don't care [1217] L158-6-->L158-14: Formula: (and (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_In_1| v_~client_size~0_Out_2) (= 0 (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~manager~0.offset_Out_2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_7|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (= |v_ULTIMATE.start_main_#t~nondet27#1_In_1| v_~client_front~0_Out_2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7| v_~manager~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~client_back~0_Out_2 v_~client_front~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= v_~client_size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_In_1|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_In_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~client_back~0=v_~client_back~0_Out_2, ~manager~0.offset=v_~manager~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ~client_front~0=v_~client_front~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ~manager~0.base=v_~manager~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_Out_6|, #valid=|v_#valid_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_Out_18|, ~client_size~0=v_~client_size~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client_back~0, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~manager~0.base, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~client_front~0, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~client_size~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] 4714#[L158-14]don't care [1139] L158-14-->L158-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| .cse1))) (and (= (select |v_#valid_277| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|) 1) (= (store |v_#memory_int_243| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61| (store (select |v_#memory_int_243| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_41|)) |v_#memory_int_242|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| 4 .cse1) (select |v_#length_244| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|)) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|) (<= 0 .cse0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| |v_ULTIMATE.start_create_fresh_int_array_~size#1_102|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73|, #valid=|v_#valid_277|, #memory_int=|v_#memory_int_243|, #length=|v_#length_244|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_102|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_43|, #valid=|v_#valid_277|, #memory_int=|v_#memory_int_242|, #length=|v_#length_244|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_102|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #memory_int] 4954#[L158-14]don't care [1213] L158-14-->L158-22: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet30#1_33| v_~node_front~0_92) (= (store |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 1) |v_#valid_405|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 0)) (= (select |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147| |v_ULTIMATE.start_create_fresh_int_array_~size#1_189|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| |v_#StackHeapBarrier_68|) (= v_~client~0.base_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|) (= v_~node_back~0_110 v_~node_front~0_92) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) (= (store |v_#length_359| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4)) |v_#length_358|) (= v_~client~0.offset_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139| 0) (= |v_ULTIMATE.start_main_#t~nondet31#1_33| v_~node_size~0_70) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| v_~node_size~0_70) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4294967296) 1073741823) 1 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147|, #valid=|v_#valid_406|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_33|, #length=|v_#length_359|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_189|} OutVars{~node_back~0=v_~node_back~0_110, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139|, ~client~0.offset=v_~client~0.offset_47, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_78|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51|, ~node_size~0=v_~node_size~0_70, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|, #length=|v_#length_358|, ~client~0.base=v_~client~0.base_47, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_188|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_79|, #valid=|v_#valid_405|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_107|, ~node_front~0=v_~node_front~0_92, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~node_size~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~node_front~0, ~client~0.base, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4952#[L158-22]don't care [1169] L158-22-->L158-22: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 1)) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0 4) (select |v_#length_286| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|)) (= |v_#memory_int_274| (store |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| (store (select |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|))) (= (select |v_#valid_323| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_132|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_275|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_55|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_274|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #memory_int] 4950#[L158-22]don't care [1207] L158-22-->L140-3: Formula: (and (= v_~node~0.offset_67 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|) (= (select |v_#valid_395| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1) (= |v_ULTIMATE.start_main_#t~pre35#1_43| |v_#pthreadsForks_121|) (= |v_ULTIMATE.start_main_#t~nondet33#1_29| v_~ok~0_95) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| v_~node~0.base_67) (= v_~update~0_119 |v_ULTIMATE.start_main_#t~nondet34#1_27|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140| |v_ULTIMATE.start_create_fresh_int_array_~size#1_184|)) (= (+ |v_#pthreadsForks_121| 1) |v_#pthreadsForks_120|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_352| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= (store |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre35#1_43|)) |v_#memory_int_320|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_121|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, #valid=|v_#valid_395|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_27|, #memory_int=|v_#memory_int_321|, #length=|v_#length_352|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_29|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_43|, ~ok~0=v_~ok~0_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, ~node~0.base=v_~node~0.base_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ~node~0.offset=v_~node~0.offset_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|, #pthreadsForks=|v_#pthreadsForks_120|, #valid=|v_#valid_395|, #memory_int=|v_#memory_int_320|, #length=|v_#length_352|, ~update~0=v_~update~0_119, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret32#1.base, ULTIMATE.start_main_#t~pre35#1, ~ok~0, ULTIMATE.start_main_#t~nondet34#1, ~node~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ~update~0, ULTIMATE.start_main_#t~ret32#1.offset] 4944#[L140-3]don't care [967] L140-3-->L74: Formula: (and (= |v_ULTIMATE.start_main_#t~pre35#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_4|, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_4|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_10|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_4|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_4|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 4928#[L74, L140-4]don't care [2022-07-22 12:22:01,803 INFO L750 eck$LassoCheckResult]: Loop: 4928#[L74, L140-4]don't care [1121] L74-->L56: Formula: (let ((.cse1 (not |v_thread1_#t~short3#1_64|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (= (ite (and (< v_~manager_front~0_125 v_~manager_back~0_135) (< v_~manager_front~0_125 v_~manager_size~0_70) (<= 0 v_~manager_front~0_125)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (let ((.cse0 (= 0 (mod v_~safe~0_119 256)))) (or (and (not .cse0) |v_thread1_#t~short3#1_64|) (and .cse1 .cse0))) (not (= (mod |v_thread1Thread1of1ForFork2_#t~nondet1#1_18| 256) 0)) (= v_~manager_front~0_124 (+ v_~manager_front~0_125 1)) (= v_~safe~0_118 (ite (= (ite |v_thread1_#t~short3#1_63| 1 0) 0) 0 1)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| 0)) (or (let ((.cse4 (* v_~manager_front~0_125 4))) (let ((.cse3 (+ .cse4 v_~manager~0.offset_75))) (and (let ((.cse2 (= |v_thread1_#t~mem2#1_36| v_~update~0_75))) (or (and (not .cse2) (not |v_thread1_#t~short3#1_63|)) (and .cse2 |v_thread1_#t~short3#1_63|))) (= |v_thread1_#t~mem2#1_36| (select (select |v_#memory_int_224| v_~manager~0.base_75) .cse3)) (<= (+ .cse4 4 v_~manager~0.offset_75) (select |v_#length_224| v_~manager~0.base_75)) |v_thread1_#t~short3#1_64| (<= 0 .cse3) (= (select |v_#valid_257| v_~manager~0.base_75) 1)))) (and .cse1 (= |v_thread1_#t~short3#1_63| |v_thread1_#t~short3#1_64|) (= |v_thread1_#t~mem2#1_36| |v_thread1Thread1of1ForFork2_#t~mem2#1_22|))))) InVars {~manager_front~0=v_~manager_front~0_125, ~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~safe~0=v_~safe~0_119, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_22|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_18|, ~manager_back~0=v_~manager_back~0_135, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, ~update~0=v_~update~0_75} OutVars{~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~manager_back~0=v_~manager_back~0_135, ~manager_front~0=v_~manager_front~0_124, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|, ~safe~0=v_~safe~0_118, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_13|, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_13|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39|, ~update~0=v_~update~0_75} AuxVars[|v_thread1_#t~mem2#1_36|, |v_thread1_#t~short3#1_64|, |v_thread1_#t~short3#1_63|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 4930#[L140-4, L56]don't care [938] L56-->L62: Formula: (let ((.cse0 (* v_~node_back~0_49 4))) (let ((.cse1 (+ .cse0 v_~node~0.offset_21))) (and (= (select |v_#valid_99| v_~node~0.base_21) 1) (<= (+ .cse0 v_~node~0.offset_21 4) (select |v_#length_92| v_~node~0.base_21)) (not (= (ite (and (< v_~node_back~0_49 v_~node_size~0_16) (<= 0 v_~node_back~0_49)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_86| v_~node~0.base_21) .cse1) v_~update~0_31) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= v_~node_back~0_48 (+ v_~node_back~0_49 1)) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))))) InVars {~node_back~0=v_~node_back~0_49, ~node_size~0=v_~node_size~0_16, #valid=|v_#valid_99|, ~node~0.base=v_~node~0.base_21, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, ~node~0.offset=v_~node~0.offset_21, ~update~0=v_~update~0_31} OutVars{~node_back~0=v_~node_back~0_48, ~node~0.base=v_~node~0.base_21, ~node~0.offset=v_~node~0.offset_21, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_1|, ~node_size~0=v_~node_size~0_16, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_1|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~update~0=v_~update~0_31} AuxVars[] AssignedVars[~node_back~0, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 4942#[L62, L140-4]don't care [939] L62-->L68: Formula: (let ((.cse1 (not |v_thread1_#t~short8#1_45|))) (and (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (= v_~manager_front~0_80 (+ v_~manager_front~0_81 1)) (= v_~safe~0_68 (ite (= (ite |v_thread1_#t~short8#1_46| 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= (ite (and (<= 0 v_~manager_front~0_81) (< v_~manager_front~0_81 v_~manager_back~0_107) (< v_~manager_front~0_81 v_~manager_size~0_42)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|) (let ((.cse0 (= (mod v_~safe~0_69 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) |v_thread1_#t~short8#1_45|))) (or (and (= |v_thread1_#t~mem7#1_28| |v_thread1Thread1of1ForFork2_#t~mem7#1_1|) (= |v_thread1_#t~short8#1_45| |v_thread1_#t~short8#1_46|) .cse1) (let ((.cse3 (* v_~manager_front~0_81 4))) (let ((.cse4 (+ .cse3 v_~manager~0.offset_49))) (and (let ((.cse2 (= |v_thread1_#t~mem7#1_28| v_~ok~0_43))) (or (and (not .cse2) (not |v_thread1_#t~short8#1_46|)) (and .cse2 |v_thread1_#t~short8#1_46|))) (= (select |v_#valid_119| v_~manager~0.base_49) 1) (<= (+ 4 .cse3 v_~manager~0.offset_49) (select |v_#length_112| v_~manager~0.base_49)) (= |v_thread1_#t~mem7#1_28| (select (select |v_#memory_int_106| v_~manager~0.base_49) .cse4)) (<= 0 .cse4) |v_thread1_#t~short8#1_45|)))))) InVars {~manager_front~0=v_~manager_front~0_81, ~manager~0.offset=v_~manager~0.offset_49, ~ok~0=v_~ok~0_43, ~manager~0.base=v_~manager~0.base_49, #valid=|v_#valid_119|, ~safe~0=v_~safe~0_69, #memory_int=|v_#memory_int_106|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_1|, #length=|v_#length_112|, ~manager_back~0=v_~manager_back~0_107, ~manager_size~0=v_~manager_size~0_42} OutVars{~manager~0.offset=v_~manager~0.offset_49, ~ok~0=v_~ok~0_43, ~manager~0.base=v_~manager~0.base_49, ~manager_back~0=v_~manager_back~0_107, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_1|, ~manager_front~0=v_~manager_front~0_80, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~safe~0=v_~safe~0_68, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_106|, #length=|v_#length_112|, ~manager_size~0=v_~manager_size~0_42, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|} AuxVars[|v_thread1_#t~short8#1_45|, |v_thread1_#t~short8#1_46|, |v_thread1_#t~mem7#1_28|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 4938#[L140-4, L68]don't care [940] L68-->L74: Formula: (let ((.cse0 (* v_~client_back~0_51 4))) (let ((.cse1 (+ v_~client~0.offset_21 .cse0))) (and (<= (+ v_~client~0.offset_21 4 .cse0) (select |v_#length_116| v_~client~0.base_21)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|) (<= 0 .cse1) (= (select |v_#valid_123| v_~client~0.base_21) 1) (= (ite (= (select (select |v_#memory_int_110| v_~client~0.base_21) .cse1) v_~ok~0_47) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|)) (= (+ v_~client_back~0_51 1) v_~client_back~0_50) (not (= (ite (and (<= 0 v_~client_back~0_51) (< v_~client_back~0_51 v_~client_size~0_30)) 1 0) 0))))) InVars {~client_back~0=v_~client_back~0_51, ~client~0.offset=v_~client~0.offset_21, ~ok~0=v_~ok~0_47, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_110|, #length=|v_#length_116|, ~client_size~0=v_~client_size~0_30, ~client~0.base=v_~client~0.base_21} OutVars{~client_back~0=v_~client_back~0_50, ~client~0.offset=v_~client~0.offset_21, ~ok~0=v_~ok~0_47, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_1|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_110|, #length=|v_#length_116|, ~client_size~0=v_~client_size~0_30, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_7|, ~client~0.base=v_~client~0.base_21} AuxVars[] AssignedVars[~client_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 4928#[L74, L140-4]don't care [2022-07-22 12:22:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:01,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1810221651, now seen corresponding path program 1 times [2022-07-22 12:22:01,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:01,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579772281] [2022-07-22 12:22:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:01,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:01,850 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:01,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:01,884 INFO L85 PathProgramCache]: Analyzing trace with hash 35250699, now seen corresponding path program 4 times [2022-07-22 12:22:01,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:01,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317287176] [2022-07-22 12:22:01,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:01,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:01,910 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:01,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash -309763657, now seen corresponding path program 1 times [2022-07-22 12:22:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:01,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699948026] [2022-07-22 12:22:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:22:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 12:22:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:22:02,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699948026] [2022-07-22 12:22:02,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699948026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:22:02,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:22:02,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:22:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084170386] [2022-07-22 12:22:02,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:22:03,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:22:03,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:22:03,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:22:03,299 INFO L87 Difference]: Start difference. First operand 334 states and 957 transitions. cyclomatic complexity: 714 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-22 12:22:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:22:03,375 INFO L93 Difference]: Finished difference Result 394 states and 1147 transitions. [2022-07-22 12:22:03,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 394 states and 1147 transitions. [2022-07-22 12:22:03,380 INFO L131 ngComponentsAnalysis]: Automaton has 82 accepting balls. 244 [2022-07-22 12:22:03,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 394 states to 392 states and 1142 transitions. [2022-07-22 12:22:03,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 385 [2022-07-22 12:22:03,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 385 [2022-07-22 12:22:03,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 392 states and 1142 transitions. [2022-07-22 12:22:03,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:22:03,387 INFO L220 hiAutomatonCegarLoop]: Abstraction has 392 states and 1142 transitions. [2022-07-22 12:22:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states and 1142 transitions. [2022-07-22 12:22:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 344. [2022-07-22 12:22:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 344 states have (on average 2.941860465116279) internal successors, (1012), 343 states have internal predecessors, (1012), 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-22 12:22:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1012 transitions. [2022-07-22 12:22:03,400 INFO L242 hiAutomatonCegarLoop]: Abstraction has 344 states and 1012 transitions. [2022-07-22 12:22:03,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:22:03,401 INFO L425 stractBuchiCegarLoop]: Abstraction has 344 states and 1012 transitions. [2022-07-22 12:22:03,401 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:22:03,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 1012 transitions. [2022-07-22 12:22:03,404 INFO L131 ngComponentsAnalysis]: Automaton has 82 accepting balls. 244 [2022-07-22 12:22:03,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:22:03,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:22:03,405 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:22:03,405 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:22:03,406 INFO L748 eck$LassoCheckResult]: Stem: 5836#[ULTIMATE.startENTRY]don't care [1218] ULTIMATE.startENTRY-->L158-6: Formula: (let ((.cse1 (store |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (let ((.cse2 (select |v_#memory_int_326| 1)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75| 1))) (and (= v_~node~0.base_71 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) (= v_~client~0.base_51 0) (= v_~manager_back~0_201 v_~manager_front~0_188) (= v_~manager_size~0_128 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|) (= |v_#NULL.base_12| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75|) 0) (= v_~ok~0_99 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57| |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) (= (select |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) 1 0))) (= (select |v_#valid_423| 2) 1) (= v_~node~0.offset_71 0) (= v_~manager~0.offset_127 0) (= v_~node_back~0_114 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|) (= (store (store (store (store |v_#length_376| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_75| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4)) |v_#length_374|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_65| 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (= v_~manager~0.base_127 0) (= (select .cse2 1) 0) (= v_~node_size~0_74 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|) (= v_~client_size~0_74 0) (= v_~client~0.offset_51 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4294967296) 1073741823) 1 0)) (< 0 |v_#StackHeapBarrier_76|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_75| 0) (= |v_#valid_421| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= (select |v_#valid_423| 0) 0) (= (select .cse2 0) 48) (= (select |v_#length_376| 1) 2) (= 0 v_~node_front~0_96) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|) (= v_~safe~0_204 1) (= v_~client_front~0_72 0) (= v_~update~0_123 0) (= (select |v_#valid_423| 1) 1) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= v_~client_back~0_92 0) (= 22 (select |v_#length_376| 2)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_76|, #valid=|v_#valid_423|, #memory_int=|v_#memory_int_326|, #length=|v_#length_376|} OutVars{~node_back~0=v_~node_back~0_114, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_51|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_28|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_37|, ~manager_front~0=v_~manager_front~0_188, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~node_size~0=v_~node_size~0_74, ~client_front~0=v_~client_front~0_72, #length=|v_#length_374|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_41|, ~client~0.base=v_~client~0.base_51, ~update~0=v_~update~0_123, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~ok~0=v_~ok~0_99, ~node~0.base=v_~node~0.base_71, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_198|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_34|, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_22|, ~safe~0=v_~safe~0_204, ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_22|, ~client_size~0=v_~client_size~0_74, ~node_front~0=v_~node_front~0_96, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_37|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_44|, ~client_back~0=v_~client_back~0_92, ~client~0.offset=v_~client~0.offset_51, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_33|, ~manager~0.offset=v_~manager~0.offset_127, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_84|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_65|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_41|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_32|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_30|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~manager_back~0=v_~manager_back~0_201, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_94|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~node~0.offset=v_~node~0.offset_71, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_33|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_69|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_119|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ~manager~0.base=v_~manager~0.base_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_19|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_85|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_326|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_119|, ~manager_size~0=v_~manager_size~0_128, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~ret29#1.offset, ~manager_front~0, ULTIMATE.start_main_#t~nondet30#1, ~node_size~0, ~client_front~0, #length, ULTIMATE.start_main_#t~ret26#1.offset, ~client~0.base, ~update~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ~node~0.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~mem42#1, ~safe~0, ULTIMATE.start_main_#t~mem41#1, ~client_size~0, ~node_front~0, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~nondet28#1, ~client_back~0, ~client~0.offset, ULTIMATE.start_main_#t~ret32#1.base, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ~manager_back~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ~manager~0.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, ~manager_size~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5778#[L158-6]don't care [1217] L158-6-->L158-14: Formula: (and (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_In_1| v_~client_size~0_Out_2) (= 0 (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~manager~0.offset_Out_2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_7|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (= |v_ULTIMATE.start_main_#t~nondet27#1_In_1| v_~client_front~0_Out_2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7| v_~manager~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~client_back~0_Out_2 v_~client_front~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= v_~client_size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_In_1|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_In_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~client_back~0=v_~client_back~0_Out_2, ~manager~0.offset=v_~manager~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ~client_front~0=v_~client_front~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ~manager~0.base=v_~manager~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_Out_6|, #valid=|v_#valid_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_Out_18|, ~client_size~0=v_~client_size~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client_back~0, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~manager~0.base, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~client_front~0, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~client_size~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] 5692#[L158-14]don't care [1213] L158-14-->L158-22: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet30#1_33| v_~node_front~0_92) (= (store |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 1) |v_#valid_405|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 0)) (= (select |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147| |v_ULTIMATE.start_create_fresh_int_array_~size#1_189|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| |v_#StackHeapBarrier_68|) (= v_~client~0.base_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|) (= v_~node_back~0_110 v_~node_front~0_92) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) (= (store |v_#length_359| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4)) |v_#length_358|) (= v_~client~0.offset_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139| 0) (= |v_ULTIMATE.start_main_#t~nondet31#1_33| v_~node_size~0_70) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| v_~node_size~0_70) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4294967296) 1073741823) 1 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147|, #valid=|v_#valid_406|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_33|, #length=|v_#length_359|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_189|} OutVars{~node_back~0=v_~node_back~0_110, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139|, ~client~0.offset=v_~client~0.offset_47, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_78|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51|, ~node_size~0=v_~node_size~0_70, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|, #length=|v_#length_358|, ~client~0.base=v_~client~0.base_47, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_188|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_79|, #valid=|v_#valid_405|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_107|, ~node_front~0=v_~node_front~0_92, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~node_size~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~node_front~0, ~client~0.base, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5592#[L158-22]don't care [1169] L158-22-->L158-22: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 1)) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0 4) (select |v_#length_286| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|)) (= |v_#memory_int_274| (store |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| (store (select |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|))) (= (select |v_#valid_323| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_132|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_275|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_55|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_274|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #memory_int] 5594#[L158-22]don't care [1207] L158-22-->L140-3: Formula: (and (= v_~node~0.offset_67 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|) (= (select |v_#valid_395| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1) (= |v_ULTIMATE.start_main_#t~pre35#1_43| |v_#pthreadsForks_121|) (= |v_ULTIMATE.start_main_#t~nondet33#1_29| v_~ok~0_95) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| v_~node~0.base_67) (= v_~update~0_119 |v_ULTIMATE.start_main_#t~nondet34#1_27|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140| |v_ULTIMATE.start_create_fresh_int_array_~size#1_184|)) (= (+ |v_#pthreadsForks_121| 1) |v_#pthreadsForks_120|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_352| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= (store |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre35#1_43|)) |v_#memory_int_320|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_121|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, #valid=|v_#valid_395|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_27|, #memory_int=|v_#memory_int_321|, #length=|v_#length_352|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_29|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_43|, ~ok~0=v_~ok~0_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, ~node~0.base=v_~node~0.base_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ~node~0.offset=v_~node~0.offset_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|, #pthreadsForks=|v_#pthreadsForks_120|, #valid=|v_#valid_395|, #memory_int=|v_#memory_int_320|, #length=|v_#length_352|, ~update~0=v_~update~0_119, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret32#1.base, ULTIMATE.start_main_#t~pre35#1, ~ok~0, ULTIMATE.start_main_#t~nondet34#1, ~node~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ~update~0, ULTIMATE.start_main_#t~ret32#1.offset] 5596#[L140-3]don't care [967] L140-3-->L74: Formula: (and (= |v_ULTIMATE.start_main_#t~pre35#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_4|, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_4|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_10|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_4|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_4|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 5556#[L74, L140-4]don't care [1174] L74-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= 0 (mod |v_thread1Thread1of1ForFork2_#t~nondet1#1_In_1| 256)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0)) InVars {thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_In_1|} OutVars{thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base] 5558#[L140-4, thread1EXIT]don't care [1158] L140-4-->L141-3: Formula: (and (= (select |v_#valid_301| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 1) (= (store |v_#memory_int_255| |v_ULTIMATE.start_main_~#t2~0#1.base_51| (store (select |v_#memory_int_255| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) |v_ULTIMATE.start_main_~#t2~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre37#1_39|)) |v_#memory_int_254|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_45|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 4) (select |v_#length_264| |v_ULTIMATE.start_main_~#t2~0#1.base_51|)) (= |v_#pthreadsForks_69| |v_ULTIMATE.start_main_#t~pre37#1_39|) (= |v_#pthreadsForks_68| (+ |v_#pthreadsForks_69| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_69|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #valid=|v_#valid_301|, #memory_int=|v_#memory_int_255|, #length=|v_#length_264|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_39|, #pthreadsForks=|v_#pthreadsForks_68|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_13|, #valid=|v_#valid_301|, #memory_int=|v_#memory_int_254|, #length=|v_#length_264|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, #pthreadsForks, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_main_#t~nondet36#1, #memory_int] 5826#[L141-3, thread1EXIT]don't care [961] L141-3-->L92: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre37#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_6|} OutVars{thread2Thread1of1ForFork0_#t~mem13#1=|v_thread2Thread1of1ForFork0_#t~mem13#1_4|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_6|, thread2Thread1of1ForFork0_#t~post17#1=|v_thread2Thread1of1ForFork0_#t~post17#1_4|, thread2Thread1of1ForFork0_#t~post15#1=|v_thread2Thread1of1ForFork0_#t~post15#1_4|, 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_6|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~short14#1=|v_thread2Thread1of1ForFork0_#t~short14#1_4|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem13#1, thread2Thread1of1ForFork0_#t~post17#1, thread2Thread1of1ForFork0_#t~post15#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem16#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~short14#1, thread2Thread1of1ForFork0_#t~nondet12#1] 5842#[thread1EXIT, L92, L141-4]don't care [1128] L92-->L86: Formula: (let ((.cse3 (not |v_thread2_#t~short14#1_58|))) (and (or (let ((.cse2 (* 4 v_~node_front~0_65))) (let ((.cse0 (+ .cse2 v_~node~0.offset_47))) (and (= |v_thread2_#t~mem13#1_38| (select (select |v_#memory_int_230| v_~node~0.base_47) .cse0)) (let ((.cse1 (= |v_thread2_#t~mem13#1_38| v_~update~0_81))) (or (and (not .cse1) (not |v_thread2_#t~short14#1_57|)) (and .cse1 |v_thread2_#t~short14#1_57|))) (<= 0 .cse0) |v_thread2_#t~short14#1_58| (= (select |v_#valid_267| v_~node~0.base_47) 1) (<= (+ .cse2 v_~node~0.offset_47 4) (select |v_#length_234| v_~node~0.base_47))))) (and .cse3 (= |v_thread2_#t~mem13#1_38| |v_thread2Thread1of1ForFork0_#t~mem13#1_14|) (= |v_thread2_#t~short14#1_58| |v_thread2_#t~short14#1_57|))) (let ((.cse4 (= (mod v_~safe~0_131 256) 0))) (or (and (not .cse4) |v_thread2_#t~short14#1_58|) (and .cse4 .cse3))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (< v_~node_front~0_65 v_~node_back~0_82) (<= 0 v_~node_front~0_65) (< v_~node_front~0_65 v_~node_size~0_44)) 1 0)) (= (ite (= (ite |v_thread2_#t~short14#1_57| 1 0) 0) 0 1) v_~safe~0_130) (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet12#1_20| 256) 0)) (= (+ 1 v_~node_front~0_65) v_~node_front~0_64) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0)))) InVars {~node_back~0=v_~node_back~0_82, thread2Thread1of1ForFork0_#t~mem13#1=|v_thread2Thread1of1ForFork0_#t~mem13#1_14|, ~node_size~0=v_~node_size~0_44, ~safe~0=v_~safe~0_131, #valid=|v_#valid_267|, ~node~0.base=v_~node~0.base_47, #memory_int=|v_#memory_int_230|, #length=|v_#length_234|, ~node_front~0=v_~node_front~0_65, ~node~0.offset=v_~node~0.offset_47, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_20|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_82, thread2Thread1of1ForFork0_#t~post15#1=|v_thread2Thread1of1ForFork0_#t~post15#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~node~0.base=v_~node~0.base_47, ~node~0.offset=v_~node~0.offset_47, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~node_size~0=v_~node_size~0_44, ~safe~0=v_~safe~0_130, #valid=|v_#valid_267|, #memory_int=|v_#memory_int_230|, #length=|v_#length_234|, ~node_front~0=v_~node_front~0_64, thread2Thread1of1ForFork0_#t~short14#1=|v_thread2Thread1of1ForFork0_#t~short14#1_9|, ~update~0=v_~update~0_81} AuxVars[|v_thread2_#t~short14#1_58|, |v_thread2_#t~mem13#1_38|, |v_thread2_#t~short14#1_57|] AssignedVars[thread2Thread1of1ForFork0_#t~mem13#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post15#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, thread2Thread1of1ForFork0_#t~short14#1, thread2Thread1of1ForFork0_#t~nondet12#1] 5670#[thread1EXIT, L86, L141-4]don't care [2022-07-22 12:22:03,407 INFO L750 eck$LassoCheckResult]: Loop: 5670#[thread1EXIT, L86, L141-4]don't care [949] L86-->L92: Formula: (let ((.cse1 (* v_~manager_back~0_82 4))) (let ((.cse0 (+ .cse1 v_~manager~0.offset_35))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| (ite (= (select (select |v_#memory_int_80| v_~manager~0.base_35) .cse0) v_~ok~0_35) 1 0)) (= (select |v_#valid_93| v_~manager~0.base_35) 1) (<= 0 .cse0) (<= (+ .cse1 4 v_~manager~0.offset_35) (select |v_#length_86| v_~manager~0.base_35)) (not (= (ite (and (< v_~manager_back~0_82 v_~manager_size~0_32) (<= 0 v_~manager_back~0_82)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= v_~manager_back~0_81 (+ v_~manager_back~0_82 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0))))) InVars {~manager~0.offset=v_~manager~0.offset_35, ~ok~0=v_~ok~0_35, ~manager~0.base=v_~manager~0.base_35, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_80|, ~manager_back~0=v_~manager_back~0_82, #length=|v_#length_86|, ~manager_size~0=v_~manager_size~0_32} OutVars{thread2Thread1of1ForFork0_#t~post17#1=|v_thread2Thread1of1ForFork0_#t~post17#1_1|, ~manager~0.offset=v_~manager~0.offset_35, ~ok~0=v_~ok~0_35, ~manager~0.base=v_~manager~0.base_35, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_1|, ~manager_back~0=v_~manager_back~0_81, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_80|, #length=|v_#length_86|, ~manager_size~0=v_~manager_size~0_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post17#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem16#1, ~manager_back~0] 5672#[thread1EXIT, L92, L141-4]don't care [1128] L92-->L86: Formula: (let ((.cse3 (not |v_thread2_#t~short14#1_58|))) (and (or (let ((.cse2 (* 4 v_~node_front~0_65))) (let ((.cse0 (+ .cse2 v_~node~0.offset_47))) (and (= |v_thread2_#t~mem13#1_38| (select (select |v_#memory_int_230| v_~node~0.base_47) .cse0)) (let ((.cse1 (= |v_thread2_#t~mem13#1_38| v_~update~0_81))) (or (and (not .cse1) (not |v_thread2_#t~short14#1_57|)) (and .cse1 |v_thread2_#t~short14#1_57|))) (<= 0 .cse0) |v_thread2_#t~short14#1_58| (= (select |v_#valid_267| v_~node~0.base_47) 1) (<= (+ .cse2 v_~node~0.offset_47 4) (select |v_#length_234| v_~node~0.base_47))))) (and .cse3 (= |v_thread2_#t~mem13#1_38| |v_thread2Thread1of1ForFork0_#t~mem13#1_14|) (= |v_thread2_#t~short14#1_58| |v_thread2_#t~short14#1_57|))) (let ((.cse4 (= (mod v_~safe~0_131 256) 0))) (or (and (not .cse4) |v_thread2_#t~short14#1_58|) (and .cse4 .cse3))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (< v_~node_front~0_65 v_~node_back~0_82) (<= 0 v_~node_front~0_65) (< v_~node_front~0_65 v_~node_size~0_44)) 1 0)) (= (ite (= (ite |v_thread2_#t~short14#1_57| 1 0) 0) 0 1) v_~safe~0_130) (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet12#1_20| 256) 0)) (= (+ 1 v_~node_front~0_65) v_~node_front~0_64) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0)))) InVars {~node_back~0=v_~node_back~0_82, thread2Thread1of1ForFork0_#t~mem13#1=|v_thread2Thread1of1ForFork0_#t~mem13#1_14|, ~node_size~0=v_~node_size~0_44, ~safe~0=v_~safe~0_131, #valid=|v_#valid_267|, ~node~0.base=v_~node~0.base_47, #memory_int=|v_#memory_int_230|, #length=|v_#length_234|, ~node_front~0=v_~node_front~0_65, ~node~0.offset=v_~node~0.offset_47, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_20|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_82, thread2Thread1of1ForFork0_#t~post15#1=|v_thread2Thread1of1ForFork0_#t~post15#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~node~0.base=v_~node~0.base_47, ~node~0.offset=v_~node~0.offset_47, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~node_size~0=v_~node_size~0_44, ~safe~0=v_~safe~0_130, #valid=|v_#valid_267|, #memory_int=|v_#memory_int_230|, #length=|v_#length_234|, ~node_front~0=v_~node_front~0_64, thread2Thread1of1ForFork0_#t~short14#1=|v_thread2Thread1of1ForFork0_#t~short14#1_9|, ~update~0=v_~update~0_81} AuxVars[|v_thread2_#t~short14#1_58|, |v_thread2_#t~mem13#1_38|, |v_thread2_#t~short14#1_57|] AssignedVars[thread2Thread1of1ForFork0_#t~mem13#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post15#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, thread2Thread1of1ForFork0_#t~short14#1, thread2Thread1of1ForFork0_#t~nondet12#1] 5670#[thread1EXIT, L86, L141-4]don't care [2022-07-22 12:22:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:03,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1141503525, now seen corresponding path program 1 times [2022-07-22 12:22:03,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:03,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343595813] [2022-07-22 12:22:03,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:03,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:22:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:22:03,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:22:03,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343595813] [2022-07-22 12:22:03,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343595813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:22:03,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:22:03,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:22:03,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796521082] [2022-07-22 12:22:03,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:22:03,489 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:22:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:03,490 INFO L85 PathProgramCache]: Analyzing trace with hash 31508, now seen corresponding path program 1 times [2022-07-22 12:22:03,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:03,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889860588] [2022-07-22 12:22:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:03,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:03,501 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:03,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:22:03,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:22:03,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:22:03,882 INFO L87 Difference]: Start difference. First operand 344 states and 1012 transitions. cyclomatic complexity: 757 Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:22:03,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:22:03,955 INFO L93 Difference]: Finished difference Result 292 states and 777 transitions. [2022-07-22 12:22:03,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 777 transitions. [2022-07-22 12:22:03,959 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 176 [2022-07-22 12:22:03,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 236 states and 671 transitions. [2022-07-22 12:22:03,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2022-07-22 12:22:03,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2022-07-22 12:22:03,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 236 states and 671 transitions. [2022-07-22 12:22:03,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:22:03,964 INFO L220 hiAutomatonCegarLoop]: Abstraction has 236 states and 671 transitions. [2022-07-22 12:22:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states and 671 transitions. [2022-07-22 12:22:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 200. [2022-07-22 12:22:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 200 states have (on average 2.935) internal successors, (587), 199 states have internal predecessors, (587), 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-22 12:22:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 587 transitions. [2022-07-22 12:22:03,974 INFO L242 hiAutomatonCegarLoop]: Abstraction has 200 states and 587 transitions. [2022-07-22 12:22:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:22:03,977 INFO L425 stractBuchiCegarLoop]: Abstraction has 200 states and 587 transitions. [2022-07-22 12:22:03,977 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:22:03,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 587 transitions. [2022-07-22 12:22:03,979 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 148 [2022-07-22 12:22:03,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:22:03,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:22:03,980 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:22:03,981 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:22:03,982 INFO L748 eck$LassoCheckResult]: Stem: 6754#[ULTIMATE.startENTRY]don't care [1218] ULTIMATE.startENTRY-->L158-6: Formula: (let ((.cse1 (store |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (let ((.cse2 (select |v_#memory_int_326| 1)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75| 1))) (and (= v_~node~0.base_71 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) (= v_~client~0.base_51 0) (= v_~manager_back~0_201 v_~manager_front~0_188) (= v_~manager_size~0_128 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|) (= |v_#NULL.base_12| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75|) 0) (= v_~ok~0_99 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57| |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) (= (select |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) 1 0))) (= (select |v_#valid_423| 2) 1) (= v_~node~0.offset_71 0) (= v_~manager~0.offset_127 0) (= v_~node_back~0_114 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|) (= (store (store (store (store |v_#length_376| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_75| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4)) |v_#length_374|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_65| 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (= v_~manager~0.base_127 0) (= (select .cse2 1) 0) (= v_~node_size~0_74 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|) (= v_~client_size~0_74 0) (= v_~client~0.offset_51 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4294967296) 1073741823) 1 0)) (< 0 |v_#StackHeapBarrier_76|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_75| 0) (= |v_#valid_421| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= (select |v_#valid_423| 0) 0) (= (select .cse2 0) 48) (= (select |v_#length_376| 1) 2) (= 0 v_~node_front~0_96) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|) (= v_~safe~0_204 1) (= v_~client_front~0_72 0) (= v_~update~0_123 0) (= (select |v_#valid_423| 1) 1) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= v_~client_back~0_92 0) (= 22 (select |v_#length_376| 2)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_76|, #valid=|v_#valid_423|, #memory_int=|v_#memory_int_326|, #length=|v_#length_376|} OutVars{~node_back~0=v_~node_back~0_114, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_51|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_28|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_37|, ~manager_front~0=v_~manager_front~0_188, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~node_size~0=v_~node_size~0_74, ~client_front~0=v_~client_front~0_72, #length=|v_#length_374|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_41|, ~client~0.base=v_~client~0.base_51, ~update~0=v_~update~0_123, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~ok~0=v_~ok~0_99, ~node~0.base=v_~node~0.base_71, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_198|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_34|, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_22|, ~safe~0=v_~safe~0_204, ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_22|, ~client_size~0=v_~client_size~0_74, ~node_front~0=v_~node_front~0_96, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_37|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_44|, ~client_back~0=v_~client_back~0_92, ~client~0.offset=v_~client~0.offset_51, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_33|, ~manager~0.offset=v_~manager~0.offset_127, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_84|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_65|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_41|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_32|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_30|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~manager_back~0=v_~manager_back~0_201, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_94|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~node~0.offset=v_~node~0.offset_71, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_33|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_69|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_119|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ~manager~0.base=v_~manager~0.base_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_19|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_85|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_326|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_119|, ~manager_size~0=v_~manager_size~0_128, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~ret29#1.offset, ~manager_front~0, ULTIMATE.start_main_#t~nondet30#1, ~node_size~0, ~client_front~0, #length, ULTIMATE.start_main_#t~ret26#1.offset, ~client~0.base, ~update~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ~node~0.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~mem42#1, ~safe~0, ULTIMATE.start_main_#t~mem41#1, ~client_size~0, ~node_front~0, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~nondet28#1, ~client_back~0, ~client~0.offset, ULTIMATE.start_main_#t~ret32#1.base, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ~manager_back~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ~manager~0.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, ~manager_size~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6718#[L158-6]don't care [1144] L158-6-->L158-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67| 4) (select |v_#length_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|)) (= (select |v_#valid_285| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_106|) (<= 0 .cse1) (= (store |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67| (store (select |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|)) |v_#memory_int_246|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_247|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_246|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int] 6720#[L158-6]don't care [1217] L158-6-->L158-14: Formula: (and (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_In_1| v_~client_size~0_Out_2) (= 0 (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~manager~0.offset_Out_2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_7|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (= |v_ULTIMATE.start_main_#t~nondet27#1_In_1| v_~client_front~0_Out_2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7| v_~manager~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~client_back~0_Out_2 v_~client_front~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= v_~client_size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_In_1|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_In_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~client_back~0=v_~client_back~0_Out_2, ~manager~0.offset=v_~manager~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ~client_front~0=v_~client_front~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ~manager~0.base=v_~manager~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_Out_6|, #valid=|v_#valid_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_Out_18|, ~client_size~0=v_~client_size~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client_back~0, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~manager~0.base, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~client_front~0, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~client_size~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] 6646#[L158-14]don't care [1139] L158-14-->L158-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| .cse1))) (and (= (select |v_#valid_277| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|) 1) (= (store |v_#memory_int_243| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61| (store (select |v_#memory_int_243| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_41|)) |v_#memory_int_242|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61| 4 .cse1) (select |v_#length_244| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|)) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|) (<= 0 .cse0) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73| |v_ULTIMATE.start_create_fresh_int_array_~size#1_102|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_73|, #valid=|v_#valid_277|, #memory_int=|v_#memory_int_243|, #length=|v_#length_244|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_102|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_61|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_61|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_72|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_43|, #valid=|v_#valid_277|, #memory_int=|v_#memory_int_242|, #length=|v_#length_244|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_102|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #memory_int] 6648#[L158-14]don't care [1213] L158-14-->L158-22: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet30#1_33| v_~node_front~0_92) (= (store |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 1) |v_#valid_405|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 0)) (= (select |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147| |v_ULTIMATE.start_create_fresh_int_array_~size#1_189|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| |v_#StackHeapBarrier_68|) (= v_~client~0.base_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|) (= v_~node_back~0_110 v_~node_front~0_92) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) (= (store |v_#length_359| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4)) |v_#length_358|) (= v_~client~0.offset_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139| 0) (= |v_ULTIMATE.start_main_#t~nondet31#1_33| v_~node_size~0_70) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| v_~node_size~0_70) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4294967296) 1073741823) 1 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147|, #valid=|v_#valid_406|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_33|, #length=|v_#length_359|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_189|} OutVars{~node_back~0=v_~node_back~0_110, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139|, ~client~0.offset=v_~client~0.offset_47, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_78|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51|, ~node_size~0=v_~node_size~0_70, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|, #length=|v_#length_358|, ~client~0.base=v_~client~0.base_47, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_188|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_79|, #valid=|v_#valid_405|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_107|, ~node_front~0=v_~node_front~0_92, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~node_size~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~node_front~0, ~client~0.base, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6650#[L158-22]don't care [1207] L158-22-->L140-3: Formula: (and (= v_~node~0.offset_67 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|) (= (select |v_#valid_395| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1) (= |v_ULTIMATE.start_main_#t~pre35#1_43| |v_#pthreadsForks_121|) (= |v_ULTIMATE.start_main_#t~nondet33#1_29| v_~ok~0_95) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| v_~node~0.base_67) (= v_~update~0_119 |v_ULTIMATE.start_main_#t~nondet34#1_27|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140| |v_ULTIMATE.start_create_fresh_int_array_~size#1_184|)) (= (+ |v_#pthreadsForks_121| 1) |v_#pthreadsForks_120|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_352| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= (store |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre35#1_43|)) |v_#memory_int_320|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_121|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, #valid=|v_#valid_395|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_27|, #memory_int=|v_#memory_int_321|, #length=|v_#length_352|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_29|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_43|, ~ok~0=v_~ok~0_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, ~node~0.base=v_~node~0.base_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ~node~0.offset=v_~node~0.offset_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|, #pthreadsForks=|v_#pthreadsForks_120|, #valid=|v_#valid_395|, #memory_int=|v_#memory_int_320|, #length=|v_#length_352|, ~update~0=v_~update~0_119, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret32#1.base, ULTIMATE.start_main_#t~pre35#1, ~ok~0, ULTIMATE.start_main_#t~nondet34#1, ~node~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ~update~0, ULTIMATE.start_main_#t~ret32#1.offset] 6748#[L140-3]don't care [967] L140-3-->L74: Formula: (and (= |v_ULTIMATE.start_main_#t~pre35#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_4|, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_4|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_10|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_4|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_4|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 6524#[L74, L140-4]don't care [1174] L74-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (= 0 (mod |v_thread1Thread1of1ForFork2_#t~nondet1#1_In_1| 256)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0)) InVars {thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_In_1|} OutVars{thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base] 6484#[L140-4, thread1EXIT]don't care [1158] L140-4-->L141-3: Formula: (and (= (select |v_#valid_301| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 1) (= (store |v_#memory_int_255| |v_ULTIMATE.start_main_~#t2~0#1.base_51| (store (select |v_#memory_int_255| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) |v_ULTIMATE.start_main_~#t2~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre37#1_39|)) |v_#memory_int_254|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_45|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 4) (select |v_#length_264| |v_ULTIMATE.start_main_~#t2~0#1.base_51|)) (= |v_#pthreadsForks_69| |v_ULTIMATE.start_main_#t~pre37#1_39|) (= |v_#pthreadsForks_68| (+ |v_#pthreadsForks_69| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_69|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #valid=|v_#valid_301|, #memory_int=|v_#memory_int_255|, #length=|v_#length_264|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_39|, #pthreadsForks=|v_#pthreadsForks_68|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_13|, #valid=|v_#valid_301|, #memory_int=|v_#memory_int_254|, #length=|v_#length_264|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, #pthreadsForks, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_main_#t~nondet36#1, #memory_int] 6486#[L141-3, thread1EXIT]don't care [961] L141-3-->L92: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre37#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_6|} OutVars{thread2Thread1of1ForFork0_#t~mem13#1=|v_thread2Thread1of1ForFork0_#t~mem13#1_4|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_6|, thread2Thread1of1ForFork0_#t~post17#1=|v_thread2Thread1of1ForFork0_#t~post17#1_4|, thread2Thread1of1ForFork0_#t~post15#1=|v_thread2Thread1of1ForFork0_#t~post15#1_4|, 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_6|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~short14#1=|v_thread2Thread1of1ForFork0_#t~short14#1_4|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem13#1, thread2Thread1of1ForFork0_#t~post17#1, thread2Thread1of1ForFork0_#t~post15#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem16#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~short14#1, thread2Thread1of1ForFork0_#t~nondet12#1] 6756#[thread1EXIT, L92, L141-4]don't care [1166] L141-4-->L142-3: Formula: (and (= (store |v_#memory_int_271| |v_ULTIMATE.start_main_~#t3~0#1.base_49| (store (select |v_#memory_int_271| |v_ULTIMATE.start_main_~#t3~0#1.base_49|) |v_ULTIMATE.start_main_~#t3~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre39#1_37|)) |v_#memory_int_270|) (= 1 (select |v_#valid_321| |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (<= (+ |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 4) (select |v_#length_284| |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= |v_#pthreadsForks_77| |v_ULTIMATE.start_main_#t~pre39#1_37|) (<= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_43|) (= |v_#pthreadsForks_76| (+ |v_#pthreadsForks_77| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_77|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, #valid=|v_#valid_321|, #memory_int=|v_#memory_int_271|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #length=|v_#length_284|} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_41|, #pthreadsForks=|v_#pthreadsForks_76|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_37|, #valid=|v_#valid_321|, #memory_int=|v_#memory_int_270|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #length=|v_#length_284|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, #pthreadsForks, ULTIMATE.start_main_#t~pre39#1, #memory_int, ULTIMATE.start_main_#t~nondet38#1] 6432#[thread1EXIT, L142-3, L92]don't care [964] L142-3-->L110: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar1_2) (= 0 v_thread3Thread1of1ForFork1_thidvar2_2) (= v_thread3Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre39#1_6|) (= 0 v_thread3Thread1of1ForFork1_thidvar3_2)) InVars {ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread3Thread1of1ForFork1_#t~post20#1=|v_thread3Thread1of1ForFork1_#t~post20#1_4|, thread3Thread1of1ForFork1_#t~mem21#1=|v_thread3Thread1of1ForFork1_#t~mem21#1_4|, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_10|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_#t~mem19#1=|v_thread3Thread1of1ForFork1_#t~mem19#1_4|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_4|, thread3Thread1of1ForFork1_#t~short22#1=|v_thread3Thread1of1ForFork1_#t~short22#1_4|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_4|, thread3Thread1of1ForFork1_#t~post23#1=|v_thread3Thread1of1ForFork1_#t~post23#1_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post20#1, thread3Thread1of1ForFork1_#t~mem21#1, thread3Thread1of1ForFork1_#t~nondet18#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_#t~mem19#1, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2, thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#t~short22#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post23#1] 6466#[L142-4, L110, L92, thread1EXIT]don't care [2022-07-22 12:22:03,982 INFO L750 eck$LassoCheckResult]: Loop: 6466#[L142-4, L110, L92, thread1EXIT]don't care [1136] L110-->L104: Formula: (let ((.cse1 (* v_~manager_back~0_148 4))) (let ((.cse0 (+ .cse1 v_~manager~0.offset_81))) (and (= (ite (= v_~update~0_85 (select (select |v_#memory_int_236| v_~manager~0.base_81) .cse0)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (<= 0 .cse0) (<= (+ .cse1 4 v_~manager~0.offset_81) (select |v_#length_238| v_~manager~0.base_81)) (not (= (mod |v_thread3Thread1of1ForFork1_#t~nondet18#1_20| 256) 0)) (not (= (ite (and (< v_~manager_back~0_148 v_~manager_size~0_78) (<= 0 v_~manager_back~0_148)) 1 0) 0)) (= v_~manager_back~0_147 (+ v_~manager_back~0_148 1)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|) (= (select |v_#valid_271| v_~manager~0.base_81) 1)))) InVars {~manager~0.offset=v_~manager~0.offset_81, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_20|, ~manager~0.base=v_~manager~0.base_81, #valid=|v_#valid_271|, #memory_int=|v_#memory_int_236|, ~manager_back~0=v_~manager_back~0_148, #length=|v_#length_238|, ~manager_size~0=v_~manager_size~0_78, ~update~0=v_~update~0_85} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~manager~0.offset=v_~manager~0.offset_81, thread3Thread1of1ForFork1_#t~post20#1=|v_thread3Thread1of1ForFork1_#t~post20#1_9|, ~manager~0.base=v_~manager~0.base_81, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, ~manager_back~0=v_~manager_back~0_147, thread3Thread1of1ForFork1_#t~mem19#1=|v_thread3Thread1of1ForFork1_#t~mem19#1_9|, #valid=|v_#valid_271|, #memory_int=|v_#memory_int_236|, #length=|v_#length_238|, ~manager_size~0=v_~manager_size~0_78, ~update~0=v_~update~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post20#1, thread3Thread1of1ForFork1_#t~nondet18#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~manager_back~0, thread3Thread1of1ForFork1_#t~mem19#1] 6440#[L104, L92, L142-4, thread1EXIT]don't care [958] L104-->L110: Formula: (let ((.cse1 (not |v_thread3_#t~short22#1_42|))) (and (= v_~safe~0_42 (ite (= (ite |v_thread3_#t~short22#1_41| 1 0) 0) 0 1)) (let ((.cse0 (= (mod v_~safe~0_43 256) 0))) (or (and |v_thread3_#t~short22#1_42| (not .cse0)) (and .cse0 .cse1))) (= (+ v_~client_front~0_37 1) v_~client_front~0_36) (or (and (= |v_thread3Thread1of1ForFork1_#t~mem21#1_1| |v_thread3_#t~mem21#1_26|) (= |v_thread3_#t~short22#1_41| |v_thread3_#t~short22#1_42|) .cse1) (let ((.cse3 (* v_~client_front~0_37 4))) (let ((.cse2 (+ v_~client~0.offset_17 .cse3))) (and (<= 0 .cse2) (= (select |v_#valid_97| v_~client~0.base_17) 1) |v_thread3_#t~short22#1_42| (<= (+ v_~client~0.offset_17 4 .cse3) (select |v_#length_90| v_~client~0.base_17)) (let ((.cse4 (= |v_thread3_#t~mem21#1_26| v_~ok~0_39))) (or (and |v_thread3_#t~short22#1_41| .cse4) (and (not .cse4) (not |v_thread3_#t~short22#1_41|)))) (= (select (select |v_#memory_int_84| v_~client~0.base_17) .cse2) |v_thread3_#t~mem21#1_26|))))) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| (ite (and (< v_~client_front~0_37 v_~client_back~0_40) (<= 0 v_~client_front~0_37) (< v_~client_back~0_40 v_~client_size~0_24)) 1 0)) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|))) InVars {~client~0.offset=v_~client~0.offset_17, ~client_back~0=v_~client_back~0_40, thread3Thread1of1ForFork1_#t~mem21#1=|v_thread3Thread1of1ForFork1_#t~mem21#1_1|, ~client_front~0=v_~client_front~0_37, ~ok~0=v_~ok~0_39, #valid=|v_#valid_97|, ~safe~0=v_~safe~0_43, #memory_int=|v_#memory_int_84|, #length=|v_#length_90|, ~client_size~0=v_~client_size~0_24, ~client~0.base=v_~client~0.base_17} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, ~client~0.offset=v_~client~0.offset_17, ~client_back~0=v_~client_back~0_40, ~ok~0=v_~ok~0_39, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, thread3Thread1of1ForFork1_#t~short22#1=|v_thread3Thread1of1ForFork1_#t~short22#1_1|, ~client_front~0=v_~client_front~0_36, ~safe~0=v_~safe~0_42, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_84|, thread3Thread1of1ForFork1_#t~post23#1=|v_thread3Thread1of1ForFork1_#t~post23#1_1|, #length=|v_#length_90|, ~client_size~0=v_~client_size~0_24, ~client~0.base=v_~client~0.base_17} AuxVars[|v_thread3_#t~mem21#1_26|, |v_thread3_#t~short22#1_42|, |v_thread3_#t~short22#1_41|] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~short22#1, ~client_front~0, thread3Thread1of1ForFork1_#t~mem21#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~safe~0, thread3Thread1of1ForFork1_#t~post23#1] 6466#[L142-4, L110, L92, thread1EXIT]don't care [2022-07-22 12:22:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:03,983 INFO L85 PathProgramCache]: Analyzing trace with hash 966876483, now seen corresponding path program 1 times [2022-07-22 12:22:03,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:03,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368870175] [2022-07-22 12:22:03,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:03,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:04,031 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:04,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash 37135, now seen corresponding path program 1 times [2022-07-22 12:22:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:04,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794364496] [2022-07-22 12:22:04,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:04,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:04,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1455400401, now seen corresponding path program 1 times [2022-07-22 12:22:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:04,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833806169] [2022-07-22 12:22:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:22:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 12:22:04,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:22:04,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833806169] [2022-07-22 12:22:04,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833806169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:22:04,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:22:04,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:22:04,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715127798] [2022-07-22 12:22:04,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:22:04,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:22:04,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:22:04,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:22:04,688 INFO L87 Difference]: Start difference. First operand 200 states and 587 transitions. cyclomatic complexity: 433 Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:22:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:22:04,764 INFO L93 Difference]: Finished difference Result 212 states and 571 transitions. [2022-07-22 12:22:04,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 571 transitions. [2022-07-22 12:22:04,767 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 124 [2022-07-22 12:22:04,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 167 states and 471 transitions. [2022-07-22 12:22:04,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2022-07-22 12:22:04,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2022-07-22 12:22:04,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 471 transitions. [2022-07-22 12:22:04,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:22:04,771 INFO L220 hiAutomatonCegarLoop]: Abstraction has 167 states and 471 transitions. [2022-07-22 12:22:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 471 transitions. [2022-07-22 12:22:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-07-22 12:22:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 2.820359281437126) internal successors, (471), 166 states have internal predecessors, (471), 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-22 12:22:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 471 transitions. [2022-07-22 12:22:04,777 INFO L242 hiAutomatonCegarLoop]: Abstraction has 167 states and 471 transitions. [2022-07-22 12:22:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:22:04,778 INFO L425 stractBuchiCegarLoop]: Abstraction has 167 states and 471 transitions. [2022-07-22 12:22:04,778 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:22:04,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 471 transitions. [2022-07-22 12:22:04,780 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 124 [2022-07-22 12:22:04,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:22:04,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:22:04,780 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:22:04,780 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:22:04,782 INFO L748 eck$LassoCheckResult]: Stem: 7348#[ULTIMATE.startENTRY]don't care [1218] ULTIMATE.startENTRY-->L158-6: Formula: (let ((.cse1 (store |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (let ((.cse2 (select |v_#memory_int_326| 1)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75| 1))) (and (= v_~node~0.base_71 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) (= v_~client~0.base_51 0) (= v_~manager_back~0_201 v_~manager_front~0_188) (= v_~manager_size~0_128 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|) (= |v_#NULL.base_12| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75|) 0) (= v_~ok~0_99 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57| |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) (= (select |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) 1 0))) (= (select |v_#valid_423| 2) 1) (= v_~node~0.offset_71 0) (= v_~manager~0.offset_127 0) (= v_~node_back~0_114 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|) (= (store (store (store (store |v_#length_376| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_75| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4)) |v_#length_374|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_65| 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (= v_~manager~0.base_127 0) (= (select .cse2 1) 0) (= v_~node_size~0_74 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|) (= v_~client_size~0_74 0) (= v_~client~0.offset_51 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4294967296) 1073741823) 1 0)) (< 0 |v_#StackHeapBarrier_76|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_75| 0) (= |v_#valid_421| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= (select |v_#valid_423| 0) 0) (= (select .cse2 0) 48) (= (select |v_#length_376| 1) 2) (= 0 v_~node_front~0_96) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|) (= v_~safe~0_204 1) (= v_~client_front~0_72 0) (= v_~update~0_123 0) (= (select |v_#valid_423| 1) 1) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= v_~client_back~0_92 0) (= 22 (select |v_#length_376| 2)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_76|, #valid=|v_#valid_423|, #memory_int=|v_#memory_int_326|, #length=|v_#length_376|} OutVars{~node_back~0=v_~node_back~0_114, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_51|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_28|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_37|, ~manager_front~0=v_~manager_front~0_188, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~node_size~0=v_~node_size~0_74, ~client_front~0=v_~client_front~0_72, #length=|v_#length_374|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_41|, ~client~0.base=v_~client~0.base_51, ~update~0=v_~update~0_123, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~ok~0=v_~ok~0_99, ~node~0.base=v_~node~0.base_71, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_198|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_34|, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_22|, ~safe~0=v_~safe~0_204, ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_22|, ~client_size~0=v_~client_size~0_74, ~node_front~0=v_~node_front~0_96, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_37|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_44|, ~client_back~0=v_~client_back~0_92, ~client~0.offset=v_~client~0.offset_51, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_33|, ~manager~0.offset=v_~manager~0.offset_127, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_84|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_65|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_41|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_32|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_30|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~manager_back~0=v_~manager_back~0_201, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_94|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~node~0.offset=v_~node~0.offset_71, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_33|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_69|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_119|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ~manager~0.base=v_~manager~0.base_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_19|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_85|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_326|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_119|, ~manager_size~0=v_~manager_size~0_128, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~ret29#1.offset, ~manager_front~0, ULTIMATE.start_main_#t~nondet30#1, ~node_size~0, ~client_front~0, #length, ULTIMATE.start_main_#t~ret26#1.offset, ~client~0.base, ~update~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ~node~0.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~mem42#1, ~safe~0, ULTIMATE.start_main_#t~mem41#1, ~client_size~0, ~node_front~0, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~nondet28#1, ~client_back~0, ~client~0.offset, ULTIMATE.start_main_#t~ret32#1.base, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ~manager_back~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ~manager~0.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, ~manager_size~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 7306#[L158-6]don't care [1144] L158-6-->L158-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67| 4) (select |v_#length_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|)) (= (select |v_#valid_285| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_106|) (<= 0 .cse1) (= (store |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67| (store (select |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|)) |v_#memory_int_246|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_247|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_246|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int] 7308#[L158-6]don't care [1217] L158-6-->L158-14: Formula: (and (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_In_1| v_~client_size~0_Out_2) (= 0 (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~manager~0.offset_Out_2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_7|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (= |v_ULTIMATE.start_main_#t~nondet27#1_In_1| v_~client_front~0_Out_2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7| v_~manager~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~client_back~0_Out_2 v_~client_front~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= v_~client_size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_In_1|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_In_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~client_back~0=v_~client_back~0_Out_2, ~manager~0.offset=v_~manager~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ~client_front~0=v_~client_front~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ~manager~0.base=v_~manager~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_Out_6|, #valid=|v_#valid_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_Out_18|, ~client_size~0=v_~client_size~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client_back~0, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~manager~0.base, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~client_front~0, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~client_size~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] 7248#[L158-14]don't care [1213] L158-14-->L158-22: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet30#1_33| v_~node_front~0_92) (= (store |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 1) |v_#valid_405|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 0)) (= (select |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147| |v_ULTIMATE.start_create_fresh_int_array_~size#1_189|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| |v_#StackHeapBarrier_68|) (= v_~client~0.base_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|) (= v_~node_back~0_110 v_~node_front~0_92) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) (= (store |v_#length_359| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4)) |v_#length_358|) (= v_~client~0.offset_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139| 0) (= |v_ULTIMATE.start_main_#t~nondet31#1_33| v_~node_size~0_70) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| v_~node_size~0_70) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4294967296) 1073741823) 1 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147|, #valid=|v_#valid_406|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_33|, #length=|v_#length_359|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_189|} OutVars{~node_back~0=v_~node_back~0_110, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139|, ~client~0.offset=v_~client~0.offset_47, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_78|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51|, ~node_size~0=v_~node_size~0_70, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|, #length=|v_#length_358|, ~client~0.base=v_~client~0.base_47, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_188|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_79|, #valid=|v_#valid_405|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_107|, ~node_front~0=v_~node_front~0_92, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~node_size~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~node_front~0, ~client~0.base, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 7158#[L158-22]don't care [1169] L158-22-->L158-22: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 1)) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0 4) (select |v_#length_286| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|)) (= |v_#memory_int_274| (store |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| (store (select |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|))) (= (select |v_#valid_323| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_132|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_275|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_55|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_274|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #memory_int] 7160#[L158-22]don't care [1207] L158-22-->L140-3: Formula: (and (= v_~node~0.offset_67 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|) (= (select |v_#valid_395| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1) (= |v_ULTIMATE.start_main_#t~pre35#1_43| |v_#pthreadsForks_121|) (= |v_ULTIMATE.start_main_#t~nondet33#1_29| v_~ok~0_95) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| v_~node~0.base_67) (= v_~update~0_119 |v_ULTIMATE.start_main_#t~nondet34#1_27|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140| |v_ULTIMATE.start_create_fresh_int_array_~size#1_184|)) (= (+ |v_#pthreadsForks_121| 1) |v_#pthreadsForks_120|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_352| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= (store |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre35#1_43|)) |v_#memory_int_320|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_121|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, #valid=|v_#valid_395|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_27|, #memory_int=|v_#memory_int_321|, #length=|v_#length_352|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_29|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_43|, ~ok~0=v_~ok~0_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, ~node~0.base=v_~node~0.base_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ~node~0.offset=v_~node~0.offset_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|, #pthreadsForks=|v_#pthreadsForks_120|, #valid=|v_#valid_395|, #memory_int=|v_#memory_int_320|, #length=|v_#length_352|, ~update~0=v_~update~0_119, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret32#1.base, ULTIMATE.start_main_#t~pre35#1, ~ok~0, ULTIMATE.start_main_#t~nondet34#1, ~node~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ~update~0, ULTIMATE.start_main_#t~ret32#1.offset] 7162#[L140-3]don't care [967] L140-3-->L74: Formula: (and (= |v_ULTIMATE.start_main_#t~pre35#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_4|, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_4|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_10|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_4|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_4|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 7134#[L74, L140-4]don't care [1158] L140-4-->L141-3: Formula: (and (= (select |v_#valid_301| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 1) (= (store |v_#memory_int_255| |v_ULTIMATE.start_main_~#t2~0#1.base_51| (store (select |v_#memory_int_255| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) |v_ULTIMATE.start_main_~#t2~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre37#1_39|)) |v_#memory_int_254|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_45|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 4) (select |v_#length_264| |v_ULTIMATE.start_main_~#t2~0#1.base_51|)) (= |v_#pthreadsForks_69| |v_ULTIMATE.start_main_#t~pre37#1_39|) (= |v_#pthreadsForks_68| (+ |v_#pthreadsForks_69| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_69|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #valid=|v_#valid_301|, #memory_int=|v_#memory_int_255|, #length=|v_#length_264|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_39|, #pthreadsForks=|v_#pthreadsForks_68|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_13|, #valid=|v_#valid_301|, #memory_int=|v_#memory_int_254|, #length=|v_#length_264|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, #pthreadsForks, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_main_#t~nondet36#1, #memory_int] 7136#[L74, L141-3]don't care [961] L141-3-->L92: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre37#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_6|} OutVars{thread2Thread1of1ForFork0_#t~mem13#1=|v_thread2Thread1of1ForFork0_#t~mem13#1_4|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_6|, thread2Thread1of1ForFork0_#t~post17#1=|v_thread2Thread1of1ForFork0_#t~post17#1_4|, thread2Thread1of1ForFork0_#t~post15#1=|v_thread2Thread1of1ForFork0_#t~post15#1_4|, 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_6|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~short14#1=|v_thread2Thread1of1ForFork0_#t~short14#1_4|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem13#1, thread2Thread1of1ForFork0_#t~post17#1, thread2Thread1of1ForFork0_#t~post15#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem16#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~short14#1, thread2Thread1of1ForFork0_#t~nondet12#1] 7342#[L74, L92, L141-4]don't care [1166] L141-4-->L142-3: Formula: (and (= (store |v_#memory_int_271| |v_ULTIMATE.start_main_~#t3~0#1.base_49| (store (select |v_#memory_int_271| |v_ULTIMATE.start_main_~#t3~0#1.base_49|) |v_ULTIMATE.start_main_~#t3~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre39#1_37|)) |v_#memory_int_270|) (= 1 (select |v_#valid_321| |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (<= (+ |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 4) (select |v_#length_284| |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= |v_#pthreadsForks_77| |v_ULTIMATE.start_main_#t~pre39#1_37|) (<= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_43|) (= |v_#pthreadsForks_76| (+ |v_#pthreadsForks_77| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_77|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, #valid=|v_#valid_321|, #memory_int=|v_#memory_int_271|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #length=|v_#length_284|} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_41|, #pthreadsForks=|v_#pthreadsForks_76|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_37|, #valid=|v_#valid_321|, #memory_int=|v_#memory_int_270|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #length=|v_#length_284|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, #pthreadsForks, ULTIMATE.start_main_#t~pre39#1, #memory_int, ULTIMATE.start_main_#t~nondet38#1] 7048#[L74, L142-3, L92]don't care [964] L142-3-->L110: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar1_2) (= 0 v_thread3Thread1of1ForFork1_thidvar2_2) (= v_thread3Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre39#1_6|) (= 0 v_thread3Thread1of1ForFork1_thidvar3_2)) InVars {ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread3Thread1of1ForFork1_#t~post20#1=|v_thread3Thread1of1ForFork1_#t~post20#1_4|, thread3Thread1of1ForFork1_#t~mem21#1=|v_thread3Thread1of1ForFork1_#t~mem21#1_4|, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_10|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_#t~mem19#1=|v_thread3Thread1of1ForFork1_#t~mem19#1_4|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_4|, thread3Thread1of1ForFork1_#t~short22#1=|v_thread3Thread1of1ForFork1_#t~short22#1_4|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_4|, thread3Thread1of1ForFork1_#t~post23#1=|v_thread3Thread1of1ForFork1_#t~post23#1_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post20#1, thread3Thread1of1ForFork1_#t~mem21#1, thread3Thread1of1ForFork1_#t~nondet18#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_#t~mem19#1, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2, thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#t~short22#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post23#1] 7050#[L74, L110, L92, L142-4]don't care [1136] L110-->L104: Formula: (let ((.cse1 (* v_~manager_back~0_148 4))) (let ((.cse0 (+ .cse1 v_~manager~0.offset_81))) (and (= (ite (= v_~update~0_85 (select (select |v_#memory_int_236| v_~manager~0.base_81) .cse0)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (<= 0 .cse0) (<= (+ .cse1 4 v_~manager~0.offset_81) (select |v_#length_238| v_~manager~0.base_81)) (not (= (mod |v_thread3Thread1of1ForFork1_#t~nondet18#1_20| 256) 0)) (not (= (ite (and (< v_~manager_back~0_148 v_~manager_size~0_78) (<= 0 v_~manager_back~0_148)) 1 0) 0)) (= v_~manager_back~0_147 (+ v_~manager_back~0_148 1)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|) (= (select |v_#valid_271| v_~manager~0.base_81) 1)))) InVars {~manager~0.offset=v_~manager~0.offset_81, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_20|, ~manager~0.base=v_~manager~0.base_81, #valid=|v_#valid_271|, #memory_int=|v_#memory_int_236|, ~manager_back~0=v_~manager_back~0_148, #length=|v_#length_238|, ~manager_size~0=v_~manager_size~0_78, ~update~0=v_~update~0_85} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~manager~0.offset=v_~manager~0.offset_81, thread3Thread1of1ForFork1_#t~post20#1=|v_thread3Thread1of1ForFork1_#t~post20#1_9|, ~manager~0.base=v_~manager~0.base_81, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, ~manager_back~0=v_~manager_back~0_147, thread3Thread1of1ForFork1_#t~mem19#1=|v_thread3Thread1of1ForFork1_#t~mem19#1_9|, #valid=|v_#valid_271|, #memory_int=|v_#memory_int_236|, #length=|v_#length_238|, ~manager_size~0=v_~manager_size~0_78, ~update~0=v_~update~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post20#1, thread3Thread1of1ForFork1_#t~nondet18#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~manager_back~0, thread3Thread1of1ForFork1_#t~mem19#1] 7052#[L74, L104, L92, L142-4]don't care [1121] L74-->L56: Formula: (let ((.cse1 (not |v_thread1_#t~short3#1_64|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (= (ite (and (< v_~manager_front~0_125 v_~manager_back~0_135) (< v_~manager_front~0_125 v_~manager_size~0_70) (<= 0 v_~manager_front~0_125)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (let ((.cse0 (= 0 (mod v_~safe~0_119 256)))) (or (and (not .cse0) |v_thread1_#t~short3#1_64|) (and .cse1 .cse0))) (not (= (mod |v_thread1Thread1of1ForFork2_#t~nondet1#1_18| 256) 0)) (= v_~manager_front~0_124 (+ v_~manager_front~0_125 1)) (= v_~safe~0_118 (ite (= (ite |v_thread1_#t~short3#1_63| 1 0) 0) 0 1)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| 0)) (or (let ((.cse4 (* v_~manager_front~0_125 4))) (let ((.cse3 (+ .cse4 v_~manager~0.offset_75))) (and (let ((.cse2 (= |v_thread1_#t~mem2#1_36| v_~update~0_75))) (or (and (not .cse2) (not |v_thread1_#t~short3#1_63|)) (and .cse2 |v_thread1_#t~short3#1_63|))) (= |v_thread1_#t~mem2#1_36| (select (select |v_#memory_int_224| v_~manager~0.base_75) .cse3)) (<= (+ .cse4 4 v_~manager~0.offset_75) (select |v_#length_224| v_~manager~0.base_75)) |v_thread1_#t~short3#1_64| (<= 0 .cse3) (= (select |v_#valid_257| v_~manager~0.base_75) 1)))) (and .cse1 (= |v_thread1_#t~short3#1_63| |v_thread1_#t~short3#1_64|) (= |v_thread1_#t~mem2#1_36| |v_thread1Thread1of1ForFork2_#t~mem2#1_22|))))) InVars {~manager_front~0=v_~manager_front~0_125, ~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~safe~0=v_~safe~0_119, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_22|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_18|, ~manager_back~0=v_~manager_back~0_135, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, ~update~0=v_~update~0_75} OutVars{~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~manager_back~0=v_~manager_back~0_135, ~manager_front~0=v_~manager_front~0_124, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|, ~safe~0=v_~safe~0_118, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_13|, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_13|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39|, ~update~0=v_~update~0_75} AuxVars[|v_thread1_#t~mem2#1_36|, |v_thread1_#t~short3#1_64|, |v_thread1_#t~short3#1_63|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 7054#[L104, L56, L92, L142-4]don't care [938] L56-->L62: Formula: (let ((.cse0 (* v_~node_back~0_49 4))) (let ((.cse1 (+ .cse0 v_~node~0.offset_21))) (and (= (select |v_#valid_99| v_~node~0.base_21) 1) (<= (+ .cse0 v_~node~0.offset_21 4) (select |v_#length_92| v_~node~0.base_21)) (not (= (ite (and (< v_~node_back~0_49 v_~node_size~0_16) (<= 0 v_~node_back~0_49)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_86| v_~node~0.base_21) .cse1) v_~update~0_31) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= v_~node_back~0_48 (+ v_~node_back~0_49 1)) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))))) InVars {~node_back~0=v_~node_back~0_49, ~node_size~0=v_~node_size~0_16, #valid=|v_#valid_99|, ~node~0.base=v_~node~0.base_21, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, ~node~0.offset=v_~node~0.offset_21, ~update~0=v_~update~0_31} OutVars{~node_back~0=v_~node_back~0_48, ~node~0.base=v_~node~0.base_21, ~node~0.offset=v_~node~0.offset_21, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_1|, ~node_size~0=v_~node_size~0_16, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_1|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~update~0=v_~update~0_31} AuxVars[] AssignedVars[~node_back~0, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 7380#[L62, L104, L92, L142-4]don't care [2022-07-22 12:22:04,783 INFO L750 eck$LassoCheckResult]: Loop: 7380#[L62, L104, L92, L142-4]don't care [1128] L92-->L86: Formula: (let ((.cse3 (not |v_thread2_#t~short14#1_58|))) (and (or (let ((.cse2 (* 4 v_~node_front~0_65))) (let ((.cse0 (+ .cse2 v_~node~0.offset_47))) (and (= |v_thread2_#t~mem13#1_38| (select (select |v_#memory_int_230| v_~node~0.base_47) .cse0)) (let ((.cse1 (= |v_thread2_#t~mem13#1_38| v_~update~0_81))) (or (and (not .cse1) (not |v_thread2_#t~short14#1_57|)) (and .cse1 |v_thread2_#t~short14#1_57|))) (<= 0 .cse0) |v_thread2_#t~short14#1_58| (= (select |v_#valid_267| v_~node~0.base_47) 1) (<= (+ .cse2 v_~node~0.offset_47 4) (select |v_#length_234| v_~node~0.base_47))))) (and .cse3 (= |v_thread2_#t~mem13#1_38| |v_thread2Thread1of1ForFork0_#t~mem13#1_14|) (= |v_thread2_#t~short14#1_58| |v_thread2_#t~short14#1_57|))) (let ((.cse4 (= (mod v_~safe~0_131 256) 0))) (or (and (not .cse4) |v_thread2_#t~short14#1_58|) (and .cse4 .cse3))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (< v_~node_front~0_65 v_~node_back~0_82) (<= 0 v_~node_front~0_65) (< v_~node_front~0_65 v_~node_size~0_44)) 1 0)) (= (ite (= (ite |v_thread2_#t~short14#1_57| 1 0) 0) 0 1) v_~safe~0_130) (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet12#1_20| 256) 0)) (= (+ 1 v_~node_front~0_65) v_~node_front~0_64) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0)))) InVars {~node_back~0=v_~node_back~0_82, thread2Thread1of1ForFork0_#t~mem13#1=|v_thread2Thread1of1ForFork0_#t~mem13#1_14|, ~node_size~0=v_~node_size~0_44, ~safe~0=v_~safe~0_131, #valid=|v_#valid_267|, ~node~0.base=v_~node~0.base_47, #memory_int=|v_#memory_int_230|, #length=|v_#length_234|, ~node_front~0=v_~node_front~0_65, ~node~0.offset=v_~node~0.offset_47, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_20|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_82, thread2Thread1of1ForFork0_#t~post15#1=|v_thread2Thread1of1ForFork0_#t~post15#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~node~0.base=v_~node~0.base_47, ~node~0.offset=v_~node~0.offset_47, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~node_size~0=v_~node_size~0_44, ~safe~0=v_~safe~0_130, #valid=|v_#valid_267|, #memory_int=|v_#memory_int_230|, #length=|v_#length_234|, ~node_front~0=v_~node_front~0_64, thread2Thread1of1ForFork0_#t~short14#1=|v_thread2Thread1of1ForFork0_#t~short14#1_9|, ~update~0=v_~update~0_81} AuxVars[|v_thread2_#t~short14#1_58|, |v_thread2_#t~mem13#1_38|, |v_thread2_#t~short14#1_57|] AssignedVars[thread2Thread1of1ForFork0_#t~mem13#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post15#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, thread2Thread1of1ForFork0_#t~short14#1, thread2Thread1of1ForFork0_#t~nondet12#1] 7378#[L62, L86, L104, L142-4]don't care [949] L86-->L92: Formula: (let ((.cse1 (* v_~manager_back~0_82 4))) (let ((.cse0 (+ .cse1 v_~manager~0.offset_35))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| (ite (= (select (select |v_#memory_int_80| v_~manager~0.base_35) .cse0) v_~ok~0_35) 1 0)) (= (select |v_#valid_93| v_~manager~0.base_35) 1) (<= 0 .cse0) (<= (+ .cse1 4 v_~manager~0.offset_35) (select |v_#length_86| v_~manager~0.base_35)) (not (= (ite (and (< v_~manager_back~0_82 v_~manager_size~0_32) (<= 0 v_~manager_back~0_82)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= v_~manager_back~0_81 (+ v_~manager_back~0_82 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0))))) InVars {~manager~0.offset=v_~manager~0.offset_35, ~ok~0=v_~ok~0_35, ~manager~0.base=v_~manager~0.base_35, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_80|, ~manager_back~0=v_~manager_back~0_82, #length=|v_#length_86|, ~manager_size~0=v_~manager_size~0_32} OutVars{thread2Thread1of1ForFork0_#t~post17#1=|v_thread2Thread1of1ForFork0_#t~post17#1_1|, ~manager~0.offset=v_~manager~0.offset_35, ~ok~0=v_~ok~0_35, ~manager~0.base=v_~manager~0.base_35, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_1|, ~manager_back~0=v_~manager_back~0_81, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_80|, #length=|v_#length_86|, ~manager_size~0=v_~manager_size~0_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post17#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem16#1, ~manager_back~0] 7380#[L62, L104, L92, L142-4]don't care [2022-07-22 12:22:04,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash -795017990, now seen corresponding path program 1 times [2022-07-22 12:22:04,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:04,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169729304] [2022-07-22 12:22:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:04,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:04,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:04,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash 36878, now seen corresponding path program 2 times [2022-07-22 12:22:04,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:04,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911283950] [2022-07-22 12:22:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:04,997 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:05,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:05,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:05,007 INFO L85 PathProgramCache]: Analyzing trace with hash 491926215, now seen corresponding path program 1 times [2022-07-22 12:22:05,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:05,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569832776] [2022-07-22 12:22:05,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:05,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:22:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:22:05,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:22:05,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569832776] [2022-07-22 12:22:05,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569832776] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:22:05,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865563181] [2022-07-22 12:22:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:05,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:22:05,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:05,112 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:22:05,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-07-22 12:22:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:22:05,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:22:05,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:22:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:22:05,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:22:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:22:05,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865563181] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:22:05,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:22:05,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-22 12:22:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203944716] [2022-07-22 12:22:05,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:22:05,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:22:05,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 12:22:05,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-22 12:22:05,730 INFO L87 Difference]: Start difference. First operand 167 states and 471 transitions. cyclomatic complexity: 338 Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:22:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:22:05,923 INFO L93 Difference]: Finished difference Result 332 states and 858 transitions. [2022-07-22 12:22:05,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 858 transitions. [2022-07-22 12:22:05,928 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 196 [2022-07-22 12:22:05,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 275 states and 742 transitions. [2022-07-22 12:22:05,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 268 [2022-07-22 12:22:05,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 268 [2022-07-22 12:22:05,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 742 transitions. [2022-07-22 12:22:05,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:22:05,933 INFO L220 hiAutomatonCegarLoop]: Abstraction has 275 states and 742 transitions. [2022-07-22 12:22:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 742 transitions. [2022-07-22 12:22:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 267. [2022-07-22 12:22:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 267 states have (on average 2.7340823970037453) internal successors, (730), 266 states have internal predecessors, (730), 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-22 12:22:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 730 transitions. [2022-07-22 12:22:05,942 INFO L242 hiAutomatonCegarLoop]: Abstraction has 267 states and 730 transitions. [2022-07-22 12:22:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 12:22:05,943 INFO L425 stractBuchiCegarLoop]: Abstraction has 267 states and 730 transitions. [2022-07-22 12:22:05,943 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 12:22:05,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 267 states and 730 transitions. [2022-07-22 12:22:05,946 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 188 [2022-07-22 12:22:05,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:22:05,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:22:05,946 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:22:05,946 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:22:05,948 INFO L748 eck$LassoCheckResult]: Stem: 8109#[ULTIMATE.startENTRY]don't care [1218] ULTIMATE.startENTRY-->L158-6: Formula: (let ((.cse1 (store |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (let ((.cse2 (select |v_#memory_int_326| 1)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75| 1))) (and (= v_~node~0.base_71 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) (= v_~client~0.base_51 0) (= v_~manager_back~0_201 v_~manager_front~0_188) (= v_~manager_size~0_128 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|) (= |v_#NULL.base_12| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_75|) 0) (= v_~ok~0_99 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57| |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) (= (select |v_#valid_423| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203| 0)) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_198|) 1 0))) (= (select |v_#valid_423| 2) 1) (= v_~node~0.offset_71 0) (= v_~manager~0.offset_127 0) (= v_~node_back~0_114 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|) (= (store (store (store (store |v_#length_376| |v_ULTIMATE.start_main_~#t1~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_75| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4)) |v_#length_374|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_65| 0) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_35| 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (= v_~manager~0.base_127 0) (= (select .cse2 1) 0) (= v_~node_size~0_74 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|) (= v_~client_size~0_74 0) (= v_~client~0.offset_51 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_198| 4294967296) 1073741823) 1 0)) (< 0 |v_#StackHeapBarrier_76|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_75| 0) (= |v_#valid_421| (store .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| 1)) (< |v_#StackHeapBarrier_76| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= (select |v_#valid_423| 0) 0) (= (select .cse2 0) 48) (= (select |v_#length_376| 1) 2) (= 0 v_~node_front~0_96) (= |v_#NULL.offset_12| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151| |v_#StackHeapBarrier_76|) (= v_~safe~0_204 1) (= v_~client_front~0_72 0) (= v_~update~0_123 0) (= (select |v_#valid_423| 1) 1) (= (select .cse3 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|) 0) (= v_~client_back~0_92 0) (= 22 (select |v_#length_376| 2)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_76|, #valid=|v_#valid_423|, #memory_int=|v_#memory_int_326|, #length=|v_#length_376|} OutVars{~node_back~0=v_~node_back~0_114, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_151|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_51|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_28|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_27|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_37|, ~manager_front~0=v_~manager_front~0_188, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~node_size~0=v_~node_size~0_74, ~client_front~0=v_~client_front~0_72, #length=|v_#length_374|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_41|, ~client~0.base=v_~client~0.base_51, ~update~0=v_~update~0_123, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_151|, ~ok~0=v_~ok~0_99, ~node~0.base=v_~node~0.base_71, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_198|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_94|, #StackHeapBarrier=|v_#StackHeapBarrier_76|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_34|, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_22|, ~safe~0=v_~safe~0_204, ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_22|, ~client_size~0=v_~client_size~0_74, ~node_front~0=v_~node_front~0_96, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_37|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_44|, ~client_back~0=v_~client_back~0_92, ~client~0.offset=v_~client~0.offset_51, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_33|, ~manager~0.offset=v_~manager~0.offset_127, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_84|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_158|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_65|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_41|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_32|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_30|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~manager_back~0=v_~manager_back~0_201, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_94|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~node~0.offset=v_~node~0.offset_71, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_57|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_203|, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_33|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_69|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_119|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ~manager~0.base=v_~manager~0.base_127, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_19|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_85|, #valid=|v_#valid_421|, #memory_int=|v_#memory_int_326|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_119|, ~manager_size~0=v_~manager_size~0_128, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_155|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~ret29#1.offset, ~manager_front~0, ULTIMATE.start_main_#t~nondet30#1, ~node_size~0, ~client_front~0, #length, ULTIMATE.start_main_#t~ret26#1.offset, ~client~0.base, ~update~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ~node~0.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~mem42#1, ~safe~0, ULTIMATE.start_main_#t~mem41#1, ~client_size~0, ~node_front~0, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_main_#t~nondet28#1, ~client_back~0, ~client~0.offset, ULTIMATE.start_main_#t~ret32#1.base, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_main_#t~nondet25#1, ULTIMATE.start_main_~#t3~0#1.base, ~manager_back~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret32#1.offset, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ~manager~0.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, ~manager_size~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 8065#[L158-6]don't care [1144] L158-6-->L158-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67| 4) (select |v_#length_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|)) (= (select |v_#valid_285| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_106|) (<= 0 .cse1) (= (store |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67| (store (select |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|)) |v_#memory_int_246|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_247|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_246|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int] 8067#[L158-6]don't care [1144] L158-6-->L158-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67| 4) (select |v_#length_252| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|)) (= (select |v_#valid_285| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_106|) (<= 0 .cse1) (= (store |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67| (store (select |v_#memory_int_247| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|)) |v_#memory_int_246|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_247|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_67|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_80|, #valid=|v_#valid_285|, #memory_int=|v_#memory_int_246|, #length=|v_#length_252|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_106|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int] 8069#[L158-6]don't care [1217] L158-6-->L158-14: Formula: (and (= (store |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 1) |v_#valid_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= |v_ULTIMATE.start_main_#t~nondet28#1_In_1| v_~client_size~0_Out_2) (= 0 (select |v_#valid_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7| v_~manager~0.offset_Out_2) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| |v_#StackHeapBarrier_In_7|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| 0)) (= |v_ULTIMATE.start_main_#t~nondet27#1_In_1| v_~client_front~0_Out_2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7| v_~manager~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_#length_Out_14| (store |v_#length_In_15| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~client_back~0_Out_2 v_~client_front~0_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|)) (= v_~client_size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_7|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_7|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_7|, #valid=|v_#valid_In_15|, #length=|v_#length_In_15|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_15|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_In_1|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_In_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_18|, ~client_back~0=v_~client_back~0_Out_2, ~manager~0.offset=v_~manager~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_14|, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ~client_front~0=v_~client_front~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #length=|v_#length_Out_14|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_Out_18|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_18|, ~manager~0.base=v_~manager~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_18|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_Out_6|, #valid=|v_#valid_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_Out_18|, ~client_size~0=v_~client_size~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client_back~0, ~manager~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ~manager~0.base, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~client_front~0, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~client_size~0, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] 8313#[L158-14]don't care [1213] L158-14-->L158-22: Formula: (and (= |v_ULTIMATE.start_main_#t~nondet30#1_33| v_~node_front~0_92) (= (store |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 1) |v_#valid_405|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| 0)) (= (select |v_#valid_406| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147| |v_ULTIMATE.start_create_fresh_int_array_~size#1_189|)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| |v_#StackHeapBarrier_68|) (= v_~client~0.base_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|) (= v_~node_back~0_110 v_~node_front~0_92) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) (= (store |v_#length_359| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4)) |v_#length_358|) (= v_~client~0.offset_47 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139| 0) (= |v_ULTIMATE.start_main_#t~nondet31#1_33| v_~node_size~0_70) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_188|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51| v_~node_size~0_70) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_188| 4294967296) 1073741823) 1 0))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_140|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_140|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_147|, #valid=|v_#valid_406|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_33|, #length=|v_#length_359|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_189|} OutVars{~node_back~0=v_~node_back~0_110, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_139|, ~client~0.offset=v_~client~0.offset_47, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_78|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_146|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_88|, ULTIMATE.start_main_#t~ret29#1.offset=|v_ULTIMATE.start_main_#t~ret29#1.offset_33|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_51|, ~node_size~0=v_~node_size~0_70, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_191|, #length=|v_#length_358|, ~client~0.base=v_~client~0.base_47, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base_107|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_139|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_188|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_88|, #StackHeapBarrier=|v_#StackHeapBarrier_68|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_79|, #valid=|v_#valid_405|, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset_107|, ~node_front~0=v_~node_front~0_92, ULTIMATE.start_main_#t~ret29#1.base=|v_ULTIMATE.start_main_#t~ret29#1.base_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_145|} AuxVars[] AssignedVars[~node_back~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~client~0.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret29#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ~node_size~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc44#1.offset, #length, ~node_front~0, ~client~0.base, ULTIMATE.start_main_#t~ret29#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 7929#[L158-22]don't care [1169] L158-22-->L158-22: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| 1)) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| .cse0 4) (select |v_#length_286| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|)) (= |v_#memory_int_274| (store |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| (store (select |v_#memory_int_275| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|))) (= (select |v_#valid_323| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95| |v_ULTIMATE.start_create_fresh_int_array_~size#1_132|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_#t~nondet46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet46#1_55|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_95|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_275|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_94|, ULTIMATE.start_create_fresh_int_array_#t~post45#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post45#1_55|, #valid=|v_#valid_323|, #memory_int=|v_#memory_int_274|, #length=|v_#length_286|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_132|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet46#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post45#1, #memory_int] 7931#[L158-22]don't care [1207] L158-22-->L140-3: Formula: (and (= v_~node~0.offset_67 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|) (= (select |v_#valid_395| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1) (= |v_ULTIMATE.start_main_#t~pre35#1_43| |v_#pthreadsForks_121|) (= |v_ULTIMATE.start_main_#t~nondet33#1_29| v_~ok~0_95) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| v_~node~0.base_67) (= v_~update~0_119 |v_ULTIMATE.start_main_#t~nondet34#1_27|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140| |v_ULTIMATE.start_create_fresh_int_array_~size#1_184|)) (= (+ |v_#pthreadsForks_121| 1) |v_#pthreadsForks_120|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_352| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|) (= (store |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_321| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre35#1_43|)) |v_#memory_int_320|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, #pthreadsForks=|v_#pthreadsForks_121|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, #valid=|v_#valid_395|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_27|, #memory_int=|v_#memory_int_321|, #length=|v_#length_352|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_133|, ULTIMATE.start_main_#t~ret32#1.base=|v_ULTIMATE.start_main_#t~ret32#1.base_29|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_43|, ~ok~0=v_~ok~0_95, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_133|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_140|, ~node~0.base=v_~node~0.base_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_84|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ~node~0.offset=v_~node~0.offset_67, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_184|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_84|, #pthreadsForks=|v_#pthreadsForks_120|, #valid=|v_#valid_395|, #memory_int=|v_#memory_int_320|, #length=|v_#length_352|, ~update~0=v_~update~0_119, ULTIMATE.start_main_#t~ret32#1.offset=|v_ULTIMATE.start_main_#t~ret32#1.offset_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret32#1.base, ULTIMATE.start_main_#t~pre35#1, ~ok~0, ULTIMATE.start_main_#t~nondet34#1, ~node~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~node~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~nondet33#1, #memory_int, ~update~0, ULTIMATE.start_main_#t~ret32#1.offset] 7933#[L140-3]don't care [967] L140-3-->L74: Formula: (and (= |v_ULTIMATE.start_main_#t~pre35#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_6|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_4|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_4|, thread1Thread1of1ForFork2_#t~post11#1=|v_thread1Thread1of1ForFork2_#t~post11#1_4|, thread1Thread1of1ForFork2_#t~mem10#1=|v_thread1Thread1of1ForFork2_#t~mem10#1_4|, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_4|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_10|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_4|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_4|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_#t~post11#1, thread1Thread1of1ForFork2_#t~mem10#1, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 7899#[L74, L140-4]don't care [1158] L140-4-->L141-3: Formula: (and (= (select |v_#valid_301| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 1) (= (store |v_#memory_int_255| |v_ULTIMATE.start_main_~#t2~0#1.base_51| (store (select |v_#memory_int_255| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) |v_ULTIMATE.start_main_~#t2~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre37#1_39|)) |v_#memory_int_254|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_45|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 4) (select |v_#length_264| |v_ULTIMATE.start_main_~#t2~0#1.base_51|)) (= |v_#pthreadsForks_69| |v_ULTIMATE.start_main_#t~pre37#1_39|) (= |v_#pthreadsForks_68| (+ |v_#pthreadsForks_69| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_69|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #valid=|v_#valid_301|, #memory_int=|v_#memory_int_255|, #length=|v_#length_264|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_39|, #pthreadsForks=|v_#pthreadsForks_68|, ULTIMATE.start_main_#t~pre35#1=|v_ULTIMATE.start_main_#t~pre35#1_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_13|, #valid=|v_#valid_301|, #memory_int=|v_#memory_int_254|, #length=|v_#length_264|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, #pthreadsForks, ULTIMATE.start_main_#t~pre35#1, ULTIMATE.start_main_#t~nondet36#1, #memory_int] 7901#[L74, L141-3]don't care [961] L141-3-->L92: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre37#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_6|} OutVars{thread2Thread1of1ForFork0_#t~mem13#1=|v_thread2Thread1of1ForFork0_#t~mem13#1_4|, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_6|, thread2Thread1of1ForFork0_#t~post17#1=|v_thread2Thread1of1ForFork0_#t~post17#1_4|, thread2Thread1of1ForFork0_#t~post15#1=|v_thread2Thread1of1ForFork0_#t~post15#1_4|, 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_6|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~short14#1=|v_thread2Thread1of1ForFork0_#t~short14#1_4|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem13#1, thread2Thread1of1ForFork0_#t~post17#1, thread2Thread1of1ForFork0_#t~post15#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem16#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~short14#1, thread2Thread1of1ForFork0_#t~nondet12#1] 8103#[L74, L92, L141-4]don't care [1166] L141-4-->L142-3: Formula: (and (= (store |v_#memory_int_271| |v_ULTIMATE.start_main_~#t3~0#1.base_49| (store (select |v_#memory_int_271| |v_ULTIMATE.start_main_~#t3~0#1.base_49|) |v_ULTIMATE.start_main_~#t3~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre39#1_37|)) |v_#memory_int_270|) (= 1 (select |v_#valid_321| |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (<= (+ |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 4) (select |v_#length_284| |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= |v_#pthreadsForks_77| |v_ULTIMATE.start_main_#t~pre39#1_37|) (<= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_43|) (= |v_#pthreadsForks_76| (+ |v_#pthreadsForks_77| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_77|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, #valid=|v_#valid_321|, #memory_int=|v_#memory_int_271|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #length=|v_#length_284|} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_41|, #pthreadsForks=|v_#pthreadsForks_76|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_37|, #valid=|v_#valid_321|, #memory_int=|v_#memory_int_270|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #length=|v_#length_284|, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, #pthreadsForks, ULTIMATE.start_main_#t~pre39#1, #memory_int, ULTIMATE.start_main_#t~nondet38#1] 7825#[L74, L142-3, L92]don't care [964] L142-3-->L110: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar1_2) (= 0 v_thread3Thread1of1ForFork1_thidvar2_2) (= v_thread3Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre39#1_6|) (= 0 v_thread3Thread1of1ForFork1_thidvar3_2)) InVars {ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread3Thread1of1ForFork1_#t~post20#1=|v_thread3Thread1of1ForFork1_#t~post20#1_4|, thread3Thread1of1ForFork1_#t~mem21#1=|v_thread3Thread1of1ForFork1_#t~mem21#1_4|, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_10|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_#t~mem19#1=|v_thread3Thread1of1ForFork1_#t~mem19#1_4|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_4|, thread3Thread1of1ForFork1_#t~short22#1=|v_thread3Thread1of1ForFork1_#t~short22#1_4|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_4|, thread3Thread1of1ForFork1_#t~post23#1=|v_thread3Thread1of1ForFork1_#t~post23#1_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post20#1, thread3Thread1of1ForFork1_#t~mem21#1, thread3Thread1of1ForFork1_#t~nondet18#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_#t~mem19#1, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2, thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#t~short22#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post23#1] 7827#[L74, L110, L92, L142-4]don't care [1136] L110-->L104: Formula: (let ((.cse1 (* v_~manager_back~0_148 4))) (let ((.cse0 (+ .cse1 v_~manager~0.offset_81))) (and (= (ite (= v_~update~0_85 (select (select |v_#memory_int_236| v_~manager~0.base_81) .cse0)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_11| 0)) (<= 0 .cse0) (<= (+ .cse1 4 v_~manager~0.offset_81) (select |v_#length_238| v_~manager~0.base_81)) (not (= (mod |v_thread3Thread1of1ForFork1_#t~nondet18#1_20| 256) 0)) (not (= (ite (and (< v_~manager_back~0_148 v_~manager_size~0_78) (<= 0 v_~manager_back~0_148)) 1 0) 0)) (= v_~manager_back~0_147 (+ v_~manager_back~0_148 1)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|) (= (select |v_#valid_271| v_~manager~0.base_81) 1)))) InVars {~manager~0.offset=v_~manager~0.offset_81, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_20|, ~manager~0.base=v_~manager~0.base_81, #valid=|v_#valid_271|, #memory_int=|v_#memory_int_236|, ~manager_back~0=v_~manager_back~0_148, #length=|v_#length_238|, ~manager_size~0=v_~manager_size~0_78, ~update~0=v_~update~0_85} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|, ~manager~0.offset=v_~manager~0.offset_81, thread3Thread1of1ForFork1_#t~post20#1=|v_thread3Thread1of1ForFork1_#t~post20#1_9|, ~manager~0.base=v_~manager~0.base_81, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|, ~manager_back~0=v_~manager_back~0_147, thread3Thread1of1ForFork1_#t~mem19#1=|v_thread3Thread1of1ForFork1_#t~mem19#1_9|, #valid=|v_#valid_271|, #memory_int=|v_#memory_int_236|, #length=|v_#length_238|, ~manager_size~0=v_~manager_size~0_78, ~update~0=v_~update~0_85} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~post20#1, thread3Thread1of1ForFork1_#t~nondet18#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~manager_back~0, thread3Thread1of1ForFork1_#t~mem19#1] 7829#[L74, L104, L92, L142-4]don't care [1121] L74-->L56: Formula: (let ((.cse1 (not |v_thread1_#t~short3#1_64|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (= (ite (and (< v_~manager_front~0_125 v_~manager_back~0_135) (< v_~manager_front~0_125 v_~manager_size~0_70) (<= 0 v_~manager_front~0_125)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|) (let ((.cse0 (= 0 (mod v_~safe~0_119 256)))) (or (and (not .cse0) |v_thread1_#t~short3#1_64|) (and .cse1 .cse0))) (not (= (mod |v_thread1Thread1of1ForFork2_#t~nondet1#1_18| 256) 0)) (= v_~manager_front~0_124 (+ v_~manager_front~0_125 1)) (= v_~safe~0_118 (ite (= (ite |v_thread1_#t~short3#1_63| 1 0) 0) 0 1)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39| 0)) (or (let ((.cse4 (* v_~manager_front~0_125 4))) (let ((.cse3 (+ .cse4 v_~manager~0.offset_75))) (and (let ((.cse2 (= |v_thread1_#t~mem2#1_36| v_~update~0_75))) (or (and (not .cse2) (not |v_thread1_#t~short3#1_63|)) (and .cse2 |v_thread1_#t~short3#1_63|))) (= |v_thread1_#t~mem2#1_36| (select (select |v_#memory_int_224| v_~manager~0.base_75) .cse3)) (<= (+ .cse4 4 v_~manager~0.offset_75) (select |v_#length_224| v_~manager~0.base_75)) |v_thread1_#t~short3#1_64| (<= 0 .cse3) (= (select |v_#valid_257| v_~manager~0.base_75) 1)))) (and .cse1 (= |v_thread1_#t~short3#1_63| |v_thread1_#t~short3#1_64|) (= |v_thread1_#t~mem2#1_36| |v_thread1Thread1of1ForFork2_#t~mem2#1_22|))))) InVars {~manager_front~0=v_~manager_front~0_125, ~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~safe~0=v_~safe~0_119, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_22|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_18|, ~manager_back~0=v_~manager_back~0_135, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, ~update~0=v_~update~0_75} OutVars{~manager~0.offset=v_~manager~0.offset_75, ~manager~0.base=v_~manager~0.base_75, ~manager_back~0=v_~manager_back~0_135, ~manager_front~0=v_~manager_front~0_124, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_39|, ~safe~0=v_~safe~0_118, #valid=|v_#valid_257|, #memory_int=|v_#memory_int_224|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_13|, #length=|v_#length_224|, ~manager_size~0=v_~manager_size~0_70, thread1Thread1of1ForFork2_#t~short3#1=|v_thread1Thread1of1ForFork2_#t~short3#1_13|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_39|, ~update~0=v_~update~0_75} AuxVars[|v_thread1_#t~mem2#1_36|, |v_thread1_#t~short3#1_64|, |v_thread1_#t~short3#1_63|] AssignedVars[~manager_front~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#t~short3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 7831#[L104, L56, L92, L142-4]don't care [938] L56-->L62: Formula: (let ((.cse0 (* v_~node_back~0_49 4))) (let ((.cse1 (+ .cse0 v_~node~0.offset_21))) (and (= (select |v_#valid_99| v_~node~0.base_21) 1) (<= (+ .cse0 v_~node~0.offset_21 4) (select |v_#length_92| v_~node~0.base_21)) (not (= (ite (and (< v_~node_back~0_49 v_~node_size~0_16) (<= 0 v_~node_back~0_49)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|) (<= 0 .cse1) (= (ite (= (select (select |v_#memory_int_86| v_~node~0.base_21) .cse1) v_~update~0_31) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|) (= v_~node_back~0_48 (+ v_~node_back~0_49 1)) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|))))) InVars {~node_back~0=v_~node_back~0_49, ~node_size~0=v_~node_size~0_16, #valid=|v_#valid_99|, ~node~0.base=v_~node~0.base_21, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, ~node~0.offset=v_~node~0.offset_21, ~update~0=v_~update~0_31} OutVars{~node_back~0=v_~node_back~0_48, ~node~0.base=v_~node~0.base_21, ~node~0.offset=v_~node~0.offset_21, thread1Thread1of1ForFork2_#t~mem5#1=|v_thread1Thread1of1ForFork2_#t~mem5#1_1|, ~node_size~0=v_~node_size~0_16, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork2_#t~post6#1=|v_thread1Thread1of1ForFork2_#t~post6#1_1|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_86|, #length=|v_#length_92|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~update~0=v_~update~0_31} AuxVars[] AssignedVars[~node_back~0, thread1Thread1of1ForFork2_#t~mem5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post6#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] 7859#[L62, L104, L92, L142-4]don't care [2022-07-22 12:22:05,949 INFO L750 eck$LassoCheckResult]: Loop: 7859#[L62, L104, L92, L142-4]don't care [1128] L92-->L86: Formula: (let ((.cse3 (not |v_thread2_#t~short14#1_58|))) (and (or (let ((.cse2 (* 4 v_~node_front~0_65))) (let ((.cse0 (+ .cse2 v_~node~0.offset_47))) (and (= |v_thread2_#t~mem13#1_38| (select (select |v_#memory_int_230| v_~node~0.base_47) .cse0)) (let ((.cse1 (= |v_thread2_#t~mem13#1_38| v_~update~0_81))) (or (and (not .cse1) (not |v_thread2_#t~short14#1_57|)) (and .cse1 |v_thread2_#t~short14#1_57|))) (<= 0 .cse0) |v_thread2_#t~short14#1_58| (= (select |v_#valid_267| v_~node~0.base_47) 1) (<= (+ .cse2 v_~node~0.offset_47 4) (select |v_#length_234| v_~node~0.base_47))))) (and .cse3 (= |v_thread2_#t~mem13#1_38| |v_thread2Thread1of1ForFork0_#t~mem13#1_14|) (= |v_thread2_#t~short14#1_58| |v_thread2_#t~short14#1_57|))) (let ((.cse4 (= (mod v_~safe~0_131 256) 0))) (or (and (not .cse4) |v_thread2_#t~short14#1_58|) (and .cse4 .cse3))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13| (ite (and (< v_~node_front~0_65 v_~node_back~0_82) (<= 0 v_~node_front~0_65) (< v_~node_front~0_65 v_~node_size~0_44)) 1 0)) (= (ite (= (ite |v_thread2_#t~short14#1_57| 1 0) 0) 0 1) v_~safe~0_130) (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet12#1_20| 256) 0)) (= (+ 1 v_~node_front~0_65) v_~node_front~0_64) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0)))) InVars {~node_back~0=v_~node_back~0_82, thread2Thread1of1ForFork0_#t~mem13#1=|v_thread2Thread1of1ForFork0_#t~mem13#1_14|, ~node_size~0=v_~node_size~0_44, ~safe~0=v_~safe~0_131, #valid=|v_#valid_267|, ~node~0.base=v_~node~0.base_47, #memory_int=|v_#memory_int_230|, #length=|v_#length_234|, ~node_front~0=v_~node_front~0_65, ~node~0.offset=v_~node~0.offset_47, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_20|, ~update~0=v_~update~0_81} OutVars{~node_back~0=v_~node_back~0_82, thread2Thread1of1ForFork0_#t~post15#1=|v_thread2Thread1of1ForFork0_#t~post15#1_9|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, ~node~0.base=v_~node~0.base_47, ~node~0.offset=v_~node~0.offset_47, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, ~node_size~0=v_~node_size~0_44, ~safe~0=v_~safe~0_130, #valid=|v_#valid_267|, #memory_int=|v_#memory_int_230|, #length=|v_#length_234|, ~node_front~0=v_~node_front~0_64, thread2Thread1of1ForFork0_#t~short14#1=|v_thread2Thread1of1ForFork0_#t~short14#1_9|, ~update~0=v_~update~0_81} AuxVars[|v_thread2_#t~short14#1_58|, |v_thread2_#t~mem13#1_38|, |v_thread2_#t~short14#1_57|] AssignedVars[thread2Thread1of1ForFork0_#t~mem13#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post15#1, ~safe~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~node_front~0, thread2Thread1of1ForFork0_#t~short14#1, thread2Thread1of1ForFork0_#t~nondet12#1] 7857#[L62, L86, L104, L142-4]don't care [949] L86-->L92: Formula: (let ((.cse1 (* v_~manager_back~0_82 4))) (let ((.cse0 (+ .cse1 v_~manager~0.offset_35))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| (ite (= (select (select |v_#memory_int_80| v_~manager~0.base_35) .cse0) v_~ok~0_35) 1 0)) (= (select |v_#valid_93| v_~manager~0.base_35) 1) (<= 0 .cse0) (<= (+ .cse1 4 v_~manager~0.offset_35) (select |v_#length_86| v_~manager~0.base_35)) (not (= (ite (and (< v_~manager_back~0_82 v_~manager_size~0_32) (<= 0 v_~manager_back~0_82)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= v_~manager_back~0_81 (+ v_~manager_back~0_82 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0))))) InVars {~manager~0.offset=v_~manager~0.offset_35, ~ok~0=v_~ok~0_35, ~manager~0.base=v_~manager~0.base_35, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_80|, ~manager_back~0=v_~manager_back~0_82, #length=|v_#length_86|, ~manager_size~0=v_~manager_size~0_32} OutVars{thread2Thread1of1ForFork0_#t~post17#1=|v_thread2Thread1of1ForFork0_#t~post17#1_1|, ~manager~0.offset=v_~manager~0.offset_35, ~ok~0=v_~ok~0_35, ~manager~0.base=v_~manager~0.base_35, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_#t~mem16#1=|v_thread2Thread1of1ForFork0_#t~mem16#1_1|, ~manager_back~0=v_~manager_back~0_81, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_80|, #length=|v_#length_86|, ~manager_size~0=v_~manager_size~0_32} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post17#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem16#1, ~manager_back~0] 7859#[L62, L104, L92, L142-4]don't care [2022-07-22 12:22:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:05,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1809403420, now seen corresponding path program 2 times [2022-07-22 12:22:05,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:05,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203264185] [2022-07-22 12:22:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:05,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:06,051 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:06,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:06,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:06,121 INFO L85 PathProgramCache]: Analyzing trace with hash 36878, now seen corresponding path program 3 times [2022-07-22 12:22:06,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:06,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130896863] [2022-07-22 12:22:06,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:06,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:06,130 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:06,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:06,141 INFO L85 PathProgramCache]: Analyzing trace with hash 625104177, now seen corresponding path program 2 times [2022-07-22 12:22:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:06,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664285677] [2022-07-22 12:22:06,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:06,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:06,251 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:06,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:16,570 WARN L233 SmtUtils]: Spent 9.87s on a formula simplification. DAG size of input: 466 DAG size of output: 381 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-22 12:22:21,495 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:22:21,495 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:22:21,496 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:22:21,496 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:22:21,496 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:22:21,496 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:21,496 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:22:21,496 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:22:21,496 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-commit-1.wvr.c_BEv2_Iteration11_Lasso [2022-07-22 12:22:21,496 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:22:21,496 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:22:21,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:21,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:23,536 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:22:23,540 INFO L158 Benchmark]: Toolchain (without parser) took 54500.10ms. Allocated memory was 152.0MB in the beginning and 396.4MB in the end (delta: 244.3MB). Free memory was 125.7MB in the beginning and 152.4MB in the end (delta: -26.7MB). Peak memory consumption was 221.3MB. Max. memory is 8.0GB. [2022-07-22 12:22:23,540 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 152.0MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:22:23,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.09ms. Allocated memory is still 152.0MB. Free memory was 125.5MB in the beginning and 113.6MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:22:23,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.33ms. Allocated memory is still 152.0MB. Free memory was 113.6MB in the beginning and 110.9MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-07-22 12:22:23,541 INFO L158 Benchmark]: Boogie Preprocessor took 46.96ms. Allocated memory is still 152.0MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:22:23,542 INFO L158 Benchmark]: RCFGBuilder took 1425.57ms. Allocated memory is still 152.0MB. Free memory was 108.8MB in the beginning and 99.2MB in the end (delta: 9.6MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. [2022-07-22 12:22:23,542 INFO L158 Benchmark]: BuchiAutomizer took 52594.67ms. Allocated memory was 152.0MB in the beginning and 396.4MB in the end (delta: 244.3MB). Free memory was 99.2MB in the beginning and 152.4MB in the end (delta: -53.1MB). Peak memory consumption was 193.8MB. Max. memory is 8.0GB. [2022-07-22 12:22:23,577 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.28ms. Allocated memory is still 152.0MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 352.09ms. Allocated memory is still 152.0MB. Free memory was 125.5MB in the beginning and 113.6MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.33ms. Allocated memory is still 152.0MB. Free memory was 113.6MB in the beginning and 110.9MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.96ms. Allocated memory is still 152.0MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1425.57ms. Allocated memory is still 152.0MB. Free memory was 108.8MB in the beginning and 99.2MB in the end (delta: 9.6MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 52594.67ms. Allocated memory was 152.0MB in the beginning and 396.4MB in the end (delta: 244.3MB). Free memory was 99.2MB in the beginning and 152.4MB in the end (delta: -53.1MB). Peak memory consumption was 193.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 230 PlacesBefore, 34 PlacesAfterwards, 239 TransitionsBefore, 30 TransitionsAfterwards, 1266 CoEnabledTransitionPairs, 7 FixpointIterations, 168 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 9 ConcurrentYvCompositions, 13 ChoiceCompositions, 248 TotalNumberOfCompositions, 2576 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1680, positive: 1593, positive conditional: 0, positive unconditional: 1593, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 980, positive: 948, positive conditional: 0, positive unconditional: 948, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 980, positive: 946, positive conditional: 0, positive unconditional: 946, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 363, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 331, negative conditional: 0, negative unconditional: 331, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1680, positive: 645, positive conditional: 0, positive unconditional: 645, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 980, unknown conditional: 0, unknown unconditional: 980] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:22:23,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-07-22 12:22:23,842 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...